Rescheduling for locality in sparse matrix computations

DOI10.1007/3-540-45545-0_23MaRDI QIDQ2783001zbMATH OpenFDO

Authors Michelle Mills Strout, L. Carter, Jeanne Ferrante

Publication date 2 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45545-0_23

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Modeling and improving locality for the sparse-matrix–vector product on cache memories
• Optimizing sparse matrix computations for register reuse in SPARSITY
• Parallel sparse matrix vector multiply software for matrices with data locality
• Locality of reference in sparse Cholesky factorization methods
• SPAR: a new architecture for large finite element computations

Cited in

(5)

• Modeling and improving locality for the sparse-matrix–vector product on cache memories
• Improving the arithmetic intensity of multigrid with the help of polynomial smoothers.
• Automated tiling of unstructured mesh computations with application to seismological modeling
• Improving memory hierarchy performance for irregular applications using data and computation reorderings
• Data-centric transformations for locality enhancement

Describes a project that uses

Uses Software

• FFTW
• PHiPAC
• ATLAS
• METIS

This page was built for publication: Rescheduling for locality in sparse matrix computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783001)