On multiprocessor task scheduling using efficient state space search approaches
From MaRDI portal
Publication:852871
DOI10.1016/J.JPDC.2005.05.028zbMATH Open1103.68406OpenAlexW2074687748MaRDI QIDQ852871FDOQ852871
Authors: Yu-Kwong Kwok, Ishfaq Ahmad 
Publication date: 15 November 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.05.028
Recommendations
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
- scientific article; zbMATH DE number 1979517
- On the complexity of multiprocessor task scheduling
- Space-Efficient Scheduling of Multithreaded Computations
- scientific article; zbMATH DE number 4072695
- scientific article; zbMATH DE number 67289
- scientific article; zbMATH DE number 3970495
- A state-of-the-art review of parallel-machine scheduling research
- A parallel approximation scheme for the multiprocessor scheduling problem
Cited In (8)
- A two-pass scheduling algorithm for parallel programs
- Branch-and-bound task allocation with task clustering-based pruning
- Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
- The optimal control approach to generalized multiprocessor scheduling
- Optimal multiprocessor task scheduling using dominance and equivalence relations
- Reducing the solution space of optimal task scheduling
- Task scheduling with precedence constraints to minimize the total completion time
This page was built for publication: On multiprocessor task scheduling using efficient state space search approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852871)
