Assigning dependency graphs onto processor networks

DOI10.1016/S0167-8191(05)80018-3zbMath0723.68021MaRDI QIDQ757023

Sathiamoorthy Manoharan, Peter Thanisch

Publication date: 1991

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

schedulingheuristictask assignmentdependency graphsdepth-first breadth-next (DFBN) search

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS ⋮ Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems

This page was built for publication: Assigning dependency graphs onto processor networks