Scheduling DAGs with random parallel tasks on binarily partitionable systems

DOI10.1080/17445760500033309zbMath1121.68327OpenAlexW2021636340MaRDI QIDQ5460650

Keqin Li

Publication date: 18 July 2005

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760500033309

zbMATH Keywords

task schedulingparallel taskaverage-case performance ratiobinarily partitionable systemdirected acyclic graph (dag)

Mathematics Subject Classification ID

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

Cites Work

• Scheduling independent jobs on partitionable hypercubes
• Scheduling multiprocessor tasks -- An overview
• Analysis of the list scheduling algorithm for precedence constrained parallel tasks
• Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Concurrent Task Systems
• Some Analysis Techniques for Asynchronous Multiprocessor Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS
• Bounds on Multiprocessing Timing Anomalies
• Optimal Scheduling Strategies in a Multiprocessor System