CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS

DOI10.1142/S0129054106003838zbMath1093.68011MaRDI QIDQ5291296

Franck Butelle, Mourad Hakem

Publication date: 10 May 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

schedulingclusteringdistributed computingdirected acyclic graphsDAGsprecedence task graphsparallel scheduling

Mathematics Subject Classification ID

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

Related Items (3)

Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics ⋮ Reliability and performance optimization of pipelined real-time systems ⋮ Failure-aware resource management for high-availability computing clusters with distributed virtual machines

Cites Work

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• List scheduling with and without communication delays
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times

This page was built for publication: CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS