Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations
Álvaro L. G. A. Coutinho, Marcos A. D. Martins, Rubens M. Sydenstricker, Renato Nascimento Elias · International Journal for Numerical Methods in Engineering · 2006
Several performance improvements for finite-element edge-based sparse matrix–vector multiplication algorithms on unstructured grids are presented and tested. Edge data structures for tetrahedral meshes and triangular interface elements are treated, focusing on nodal and edges renumbering strategies for improving processor and memory hierarchy use. Benchmark computations on Intel Itanium 2 and Pentium IV processors are performed. The results show performance improvements in CPU time ranging from 2 to 3. Copyright © 2005 John Wiley & Sons, Ltd.