| Author | M. Zhou, O. Sahni, M. S. Shephard, C. D. Carothers and K. E. Jansen |
|---|---|
| Title | Adjacency based reordering algorithm for acceleration of finite element computations |
| Year | 2010 |
| Journal | Scientific Programming |
| Volume | 18 |
| Pages | 107-123 |
| Issue | 2 |
| Abstract | Effective use of the processor memory hierarchy is an important issue in high performance computing. In this work, a part level mesh topological traversal algorithm is used to defne a reordering of both mesh vertices and regions that increases the spatial locality of data and improves overall cache utilization during on processor finite element calculations. Examples based on adaptively created unstructured meshes are considered to demonstrate the effectiveness of the procedure in cases where the load per processing core is varied but balanced(e.g., elements are equally distributed across cores for a given partition). In one example,the effect of the current ajacency-based data reordering is studied for different phases of an implicit analysis including element-data blocking, element-level computations, sparse-matrix filling and equation solution. These results are compared to a case where reordering is applied to mesh vertices only. The computations are performed on various supercomputers including IBM Blue Gene(BG/L and BG/P), Cray XT(XT3 and XT5)and Sun Constellation Cluster. It is observed that reordering improves the per-core performance by up to 24% on Blue Gene/L and up to 40% on Cray XT5. The CrayPat hardware performance tool is used to measure the number of cache misses across each level of the memory hierarchy. It is determined that the measured decrease in L1, L2 and L3 cache misses when data reordering is used, closely accounts for the observed decrease in the overall execution time. Keywords: data reordering; cache penalty model; unstructured mesh; finite element analysis |
| PDF File |  Download |
| DOI Link | 10.3233/SPR-2010-0301 |