A data-parallel formulation for divide and conquer algorithms

DOI10.1093/COMJNL/44.4.303MaRDI QIDQ2765229zbMATH OpenOpenAlexFDO

Authors M. Amor, F. Argüello, J. Lopez, O. Plata, E. L. Zapata

Publication date 23 January 2002

Published in The Computer Journal. Section A Section B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/44.4.303

zbMATH Keywords

high performance Fortranindex-digit permutationsmapping vectorsspace-filling curves

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Parallel algorithms in computer science (68W10)

Recommendations

• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
• Massive parallelization of divide-and-conquer algorithms over powerlists
• Towards a theory of parallel algorithms on concrete data structures
• Divide-and-conquer and parallel graph reduction
• Algorithmic aspects of parallel data processing
• A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers

Cited in

(8)

• A `division' transformation for program and data structures and the structure clash problem
• Parallelization of divide-and-conquer in the Bird-Meertens formalism
• Massive parallelization of divide-and-conquer algorithms over powerlists
• scientific article; zbMATH DE number 1948454 (Why is no real title available?)
• scientific article; zbMATH DE number 1844541 (Why is no real title available?)
• Parallelization of divide-and-conquer by translation to nested loops
• scientific article; zbMATH DE number 7071638 (Why is no real title available?)
• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy

This page was built for publication: A data-parallel formulation for divide and conquer algorithms

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