Presentation Open Access

Refactoring the memory access pattern to improve computational performance in NEMO

Epicoco, Italo; Mele, Francesca; Mocavero, Silvia; Chiarelli, Marco; D'Anca, Alessandro; Aloisio, Giovanni

Presentation given at EGU 2020 - doi.org/10.5194/egusphere-egu2020-9732

In the roadmap of modern parallel architectures development, the computing power of a node grows much more quickly than main memory performance (capacity, bandwidth). This leads to an even much higher gap between computing and memory resources. An efficient use of the cache memory is becoming ever more essential as optimization technique. The NEMO model uses a finite difference integration method and a regular cartesian grid for space discretization. The NEMO code reflects this choice: a generic field is represented in memory as a 3D array; and the code is mainly composed of three-level nested loops. These loops often include only a few operations in the body; the results are stored in a temporary 3D array and then used in subsequent loops until the final calculation.
The aim of this work is to make better use of the cache memory by fusing DO loops together. The loop fusion is a transformation which takes two or more adjacent loops that have the same iteration space traversal and combines their bodies into a single loop.
The fusion of the loops is not trivial, and it could require introducing additional redundant operations to solve data dependencies. Unfortunately, this leads to a drawback of the overall performance. To avoid the redundant operation, we can adopt pointers to arrays and implement a pointer rotation at each loop iteration.
We have developed the loop fusion transformation in an advection kernel extracted from the NEMO oceanic model. We have compared 3 different versions of the optimized advection kernel, with 3 different levels of loop fusion.
The first prototype refers to the implementation where the extreme fusion is applied, and all loops in the routine have been fused. In this version, the operations are replicated up to 3 times. In the second prototype the buffer rotation has been applied only in the outermost loop. In the third prototype, the buffer rotation has also been implemented for the second dimension, and this version introduces only a limited amount of redundant operations.

 

Files (6.8 MB)
Name Size
EGU2020-9732.pdf
md5:73638ab028ec121dce8ccce2cff05953
6.8 MB Download
24
21
views
downloads
All versions This version
Views 2424
Downloads 2121
Data volume 143.8 MB143.8 MB
Unique views 2121
Unique downloads 2020

Share

Cite as