Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems

DOI10.1016/J.JPDC.2005.06.012zbMATH Open1096.68567OpenAlexW2037506858MaRDI QIDQ2498703FDOQ2498703

Authors: Keqin Li 

Publication date: 16 August 2006

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

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.06.012

Recommendations

• Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation
• An efficient job scheduling algorithm in partitionable mesh connected systems
• scientific article; zbMATH DE number 1375583
• Optimal parallel processing of random task graphs
• Approximation algorithms for general parallel task scheduling

zbMATH Keywords

precedence constraintprocessor allocationaverage-case performancelargest-task-firstlevel-by-level schedulingmesh connected multicomputer systemrandom parallel tasktwo-dimensional buddy system

Mathematics Subject Classification ID

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

Cited In (3)

• An efficient job scheduling algorithm in partitionable mesh connected systems
• An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks
• Average-case analysis of isospeed scalability of parallel computations on multiprocessors

This page was built for publication: Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems

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