ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS

DOI10.1080/10637199408962536zbMath1049.68528OpenAlexW2049821450MaRDI QIDQ4820018

Hesham H. Ali, Hesham El-Rewini

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/10637199408962536

Mathematics Subject Classification ID

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

Related Items (6)

Entropic grid scheduling ⋮ Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay ⋮ Genetic algorithms for task scheduling problem ⋮ List scheduling with duplication for heterogeneous computing systems ⋮ A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures ⋮ Scheduling DAGs with random parallel tasks on binarily partitionable systems

Cites Work

• NP-complete scheduling problems
• Optimal scheduling for two-processor systems
• Scheduling Interval-Ordered Tasks
• Scheduling Graphs on Two Processors

This page was built for publication: ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS