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

DOI10.1080/10637199508915537MaRDI QIDQ4820138zbMATH OpenOpenAlexFDO

Authors Marios D. Dikaiakos, Anne Rogers, Ken Steiglitz

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

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

Cites work

• scientific article; zbMATH DE number 42110 (Why is no real title available?)
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Assigning dependency graphs onto processor networks

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

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