An efficient algorithm for irregular redistributions in parallelizing compilers

DOI10.1007/3-540-37619-4_10MaRDI QIDQ4451902zbMATH OpenFDO

Authors Hui Wang, Minyi Guo, Sushil K. Prasad, Wenxi Chen, Hui Wang, Yi Pan

Publication date 11 February 2004

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/2745/27450076.htm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers
• Efficient methods for \(kr\to r\) and \(r\to kr\) array redistribution
• Scheduling GEN\_BLOCK array redistribution
• A framework for efficient data redistribution on distributed memory multicomputers
• Optimization of array redistribution for distributed memory multicomputers

Cited in

(9)

• Dynamic data distribution and processor repartitioning for irregularly structured computations
• On further reducing the cost of parallel pipelined message broadcasts
• A message combining approach for efficient array redistribution in non-all-to-all communication networks
• Balanced, locality-based parallel irregular reductions
• Suboptimal communication schedule for GEN\_BLOCK redistribution
• Impact of data distribution on performance of irregular reductions on multithreaded architectures
• Optimal distribution assignment placement
• Irregular assignment computations on cc-NUMA multiprocessors
• A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers

Describes a project that uses

Uses Software

• MPI/MPICH

This page was built for publication: An efficient algorithm for irregular redistributions in parallelizing compilers

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