Improving memory hierarchy performance for irregular applications using data and computation reorderings

DOI10.1023/A:1011119519789zbMath0977.68008OpenAlexW2045841536MaRDI QIDQ5941767

John Mellor-Crummey, David Whalley, Ken Kennedy

Publication date: 17 January 2002

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011119519789

zbMATH Keywords

data reuserandom orderingreordering

Mathematics Subject Classification ID

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

Related Items (3)

Compact Hilbert indices: space-filling curves for domains with unequal side lengths ⋮ \texttt{libFastMesh}: an optimized finite-volume framework for computational aeroacoustics ⋮ Efficient Neighbor Search for Particle Methods on GPUs

This page was built for publication: Improving memory hierarchy performance for irregular applications using data and computation reorderings