On multiprocessor task scheduling using efficient state space search approaches
From MaRDI portal
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
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
(9)- Optimal multiprocessor task scheduling using dominance and equivalence relations
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
- A two-pass scheduling algorithm for parallel programs
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
- The optimal control approach to generalized multiprocessor scheduling
- Reducing the solution space of optimal task scheduling
- Task scheduling with precedence constraints to minimize the total completion time
- Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks
- Branch-and-bound task allocation with task clustering-based pruning
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)
