Assigning dependency graphs onto processor networks

DOI10.1016/S0167-8191(05)80018-3MaRDI QIDQ757023zbMATH OpenFDO

Authors S. Manoharan, Peter Thanisch

Publication date 1991

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(05)80018-3

zbMATH Keywords

dependency graphsdepth-first breadth-next (DFBN) searchheuristicschedulingtask assignment

Mathematics Subject Classification ID

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

Recommendations

• An assessment of assignment schemes for dependency graphs
• Heuristic algorithms for task assignment and scheduling in a processor network
• Graph approach to job assignment in distributed real-time systems
• scientific article; zbMATH DE number 1262876
• scientific article; zbMATH DE number 553908

Cited in

(7)

• Graph approach to job assignment in distributed real-time systems
• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
• scientific article; zbMATH DE number 1262876 (Why is no real title available?)
• A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS
• Effect of task duplication on the assignment of dependency graphs
• An assessment of assignment schemes for dependency graphs
• Data-dependency graph transformations for instruction scheduling

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

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