Revisiting communication code generation algorithms for message-passing systems

DOI10.1080/17445760600568089MaRDI QIDQ5481726zbMATH OpenOpenAlexFDO

Authors Clayton Ferner

Publication date 10 August 2006

Published in International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17445760600568089

zbMATH Keywords

code generationdistributed-memorymappingmessage-passingparallel computationparallelizing compiler

Mathematics Subject Classification ID

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

Recommendations

• Communication code generation in systems of affine recurrence equations
• scientific article; zbMATH DE number 1919438
• Generating local addresses and communication sets for data-parallel programs
• Improved schemes for mapping arbitrary algorithms onto processor meshes
• scientific article; zbMATH DE number 1487942

Cites work

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• scientific article; zbMATH DE number 1520614 (Why is no real title available?)
• scientific article; zbMATH DE number 814824 (Why is no real title available?)
• Maximizing parallelism and minimizing synchronization with affine partitions
• Software caching and computation migration in Olden.

Cited in

(3)

• Communication code generation in systems of affine recurrence equations
• scientific article; zbMATH DE number 1919438 (Why is no real title available?)
• Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations

This page was built for publication: Revisiting communication code generation algorithms for message-passing systems

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