Optimal scheduling algorithms for communication constrained parallel processing
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1206104
- An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
- Scheduling tasks with communication delays on parallel processors
- Scheduling with interjob communication on parallel processors
- Scheduling with interjob communication on parallel processors
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Task scheduling of parallel programs to optimize communications for cluster of SMPs
- Parallel algorithms for solution of problems in scheduling theory
Cited in
(11)- Approximation algorithms for scheduling with a limited number of communications
- Contention-free communication scheduling for array redistribution
- Approximating scheduling for multimedia applications under overload conditions
- Improving communication scheduling for array redistribution
- An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
- A comparison of multiprocessor task scheduling algorithms with communication costs
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Parallel stream scheduling for high-speed performance test systems
- scientific article; zbMATH DE number 1206104 (Why is no real title available?)
- Fast scheduling and partitioning algorithm in the multi-processor system with redundant communication resources
- Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems
This page was built for publication: Optimal scheduling algorithms for communication constrained parallel processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813028)