A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers

DOI10.1023/B:SUPE.0000026848.34971.27MaRDI QIDQ704664zbMATH OpenOpenAlexWikidataFDO

Authors Hui Wang, Minyi Guo, Daming Wei

Publication date 19 January 2005

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:supe.0000026848.34971.27

zbMATH Keywords

High Performance Fortranhigher load balancing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Nonnumerical algorithms (68W05) Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 2040815
• Scheduling GEN\_BLOCK array redistribution
• Efficient methods for \(kr\to r\) and \(r\to kr\) array redistribution
• scientific article; zbMATH DE number 2080127
• Optimization of array redistribution for distributed memory multicomputers

Cited in

(5)

• A data-parallel formulation for divide and conquer algorithms
• Scheduling GEN\_BLOCK array redistribution
• scientific article; zbMATH DE number 2040815 (Why is no real title available?)
• scientific article; zbMATH DE number 1975588 (Why is no real title available?)
• scientific article; zbMATH DE number 1760028 (Why is no real title available?)

This page was built for publication: A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers

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