Performance comparison of data-reordering algorithms for sparse matrix-vector multiplication in edge-based unstructured grid computations

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal for numerical methods in engineering 2006-04, Vol.66 (3), p.431-460
Main Authors: Coutinho, Alvaro L. G. A., Martins, Marcos A. D., Sydenstricker, Rubens M., Elias, Renato N.
Format: Article
Language:English
Subjects:
Algorithms
cache-based machines
Computation
Computational techniques
data reordering
edge-based finite elements
Exact sciences and technology
Focusing
Fundamental areas of phenomenology (including applications)
Mathematical analysis
Mathematical methods in physics
Microprocessors
Multiplication
Performance enhancement
Physics
Strategy
unstructured grids
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0029-5981
1097-0207
DOI:10.1002/nme.1557