Balanced, locality-based parallel irregular reductions

DOI10.1007/3-540-35767-X_11MaRDI QIDQ4424822zbMATH OpenFDO

Authors Eladio Gutiérrez, Oscar Plata, E. L. Zapata

Publication date 7 September 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2624/26240162.htm

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Integrating load balancing and locality in the parallelization of irregular problems
• Efficient compiler and run-time support for parallel irregular reductions
• An efficient algorithm for irregular redistributions in parallelizing compilers
• Locality behavior of parallel and sequential algorithms for irregular graph problems
• scientific article; zbMATH DE number 4045120
• A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers

Cited in

(3)

• Efficient compiler and run-time support for parallel irregular reductions
• Hypergraph-based irregular application locality optimization
• Integrating load balancing and locality in the parallelization of irregular problems

This page was built for publication: Balanced, locality-based parallel irregular reductions

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