Optimal parallel processing of random task graphs

DOI10.1002/JOS.70MaRDI QIDQ5939271zbMATH OpenOpenAlexFDO

Authors Zhen Liu, Rhonda Righter

Publication date 27 August 2001

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jos.70

zbMATH Keywords

flowtimemakespanparallel processingprecedence constraintsrandom task graphstochastic scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Dynamic scheduling of parallel computations
• Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
• Speed of parallel processing for random task graphs
• Parallel execution of schedules with random dependency graph
• On the Optimal Stochastic Scheduling of Out-Forests

Cites work

• Dynamic scheduling of parallel computations
• scientific article; zbMATH DE number 1016640 (Why is no real title available?)
• On the Optimal Stochastic Scheduling of Out-Forests
• Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
• Scheduling Opposing Forests

Cited in

(21)

• An optimal parallel processor bound in strong orientation of an undirected graph
• Parallel algorithms for redundant precedence relations elimination in task systems
• Optimal parallel scheduling for the 2-steps graph with constant task cost
• Performance analysis of parallel programs based on directed acyclic graphs
• Random allocation of jobs with weights and precedence
• Dynamic scheduling of parallel computations
• An empirical study of dynamic scheduling on rings of processors
• Parallel execution of schedules with random dependency graph
• Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems
• Performance considerations on a random graph model for parallel processing
• A comparison of random task graph generation methods for scheduling problems
• Speed of parallel processing for random task graphs
• Static assignment of stochastic tasks using majorization
• Scheduling Precedence Task Graphs with Disturbances
• Work-competitive scheduling on task dependency graphs
• scientific article; zbMATH DE number 836623 (Why is no real title available?)
• Applying Cilk in Provably Efficient Task Scheduling
• Relaxed schedulers can efficiently parallelize iterative algorithms
• An approach to parallel algorithm design
• Average execution times of series-parallel networks
• On scheduling parallel tasks at twilight

This page was built for publication: Optimal parallel processing of random task graphs

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