A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS

DOI10.1080/10637199508915537zbMath1049.68885OpenAlexW2134647130MaRDI QIDQ4820138

Kenneth Steiglitz, Marios D. Dikaiakos, Anne Rogers

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Assigning dependency graphs onto processor networks
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors

This page was built for publication: A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS