List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity

DOI10.1007/978-3-540-77444-0_24zbMath1131.68348OpenAlexW1868608845MaRDI QIDQ5445761

Sharif M. H. Chowdhury, Masud Hasan, Maruf Ahmed

Publication date: 6 March 2008

Published in: Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77444-0_24

Mathematics Subject Classification ID

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

Cites Work

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• The soft heap
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity