Revisiting communication code generation algorithms for message-passing systems

DOI10.1080/17445760600568089zbMath1098.68142OpenAlexW2007200460MaRDI QIDQ5481726

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

mappingparallel computationcode generationmessage-passingparallelizing compilerdistributed-memory

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Software caching and computation migration in Olden.
• Maximizing parallelism and minimizing synchronization with affine partitions
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors

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