List scheduling with and without communication delays

DOI10.1016/0167-8191(93)90079-ZzbMath0797.68020OpenAlexW2037987555MaRDI QIDQ1318555

Tao Yang, Apostolos Gerasoulis

Publication date: 10 April 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90079-z

zbMATH Keywords

list schedulingexperimental studycritical path heuristicnCUBE-2processor scheduling problemready list scheduling heuristicstask execution

Mathematics Subject Classification ID

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

Related Items (14)

CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS ⋮ Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays ⋮ Parallel Machine Scheduling with Uncertain Communication Delays ⋮ Reducing the solution space of optimal task scheduling ⋮ Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay ⋮ Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules ⋮ Sensitivity bounds for machine scheduling with uncertain communication delays ⋮ Quantum circuit physical design methodology with emphasis on physical synthesis ⋮ A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures ⋮ Cooperativead hoccomputing: towards enabling cooperative processing in wireless environments ⋮ Scheduling 2-dimensional grids with large communication delays ⋮ CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL ⋮ Unconstrained static scheduling with communication weights ⋮ A standard task graph set for fair evaluation of multiprocessor scheduling algorithms

This page was built for publication: List scheduling with and without communication delays