List scheduling with and without communication delays
From MaRDI portal
Publication:1318555
DOI10.1016/0167-8191(93)90079-ZzbMath0797.68020MaRDI QIDQ1318555
Tao Yang, Apostolos Gerasoulis
Publication date: 10 April 1994
Published in: Parallel Computing (Search for Journal in Brave)
list scheduling; experimental study; critical path heuristic; nCUBE-2; processor scheduling problem; ready list scheduling heuristics; task execution
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures, Parallel Machine Scheduling with Uncertain Communication Delays, Scheduling 2-dimensional grids with large communication delays, CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL, CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS, Cooperativead hoccomputing: towards enabling cooperative processing in wireless environments, Reducing the solution space of optimal task scheduling, Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules, Sensitivity bounds for machine scheduling with uncertain communication delays, Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays, Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay, Unconstrained static scheduling with communication weights, A standard task graph set for fair evaluation of multiprocessor scheduling algorithms, Quantum circuit physical design methodology with emphasis on physical synthesis
