Scheduling DAGs with random parallel tasks on binarily partitionable systems

DOI10.1080/17445760500033309MaRDI QIDQ5460650zbMATH OpenOpenAlexFDO

Authors 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

average-case performance ratiobinarily partitionable systemdirected acyclic graph (dag)parallel tasktask scheduling

Mathematics Subject Classification ID

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

Cites work

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

This page was built for publication: Scheduling DAGs with random parallel tasks on binarily partitionable systems

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