Optimized parallelization heuristic for task scheduling
From MaRDI portal
Recommendations
- Heuristic algorithms for task assignment and scheduling in a processor network
- A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems
- Computational Science and Its Applications – ICCSA 2004
- Dynamic task allocation in distributed computing systems by heuristic algorithms
- A comparison of multiprocessor task scheduling algorithms with communication costs
Cited in
(9)- Heuristic algorithms for task assignment and scheduling in a processor network
- An efficient implementation of the Min-Min heuristic
- A tricky way for analyzing the performance of scheduling parallel tasks in a multi-machine environment
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- scientific article; zbMATH DE number 1206104 (Why is no real title available?)
- scientific article; zbMATH DE number 1323826 (Why is no real title available?)
- A heuristic algorithm for dynamic task scheduling in highly parallel computing systems
- A self-modifiable approach to scheduling and mapping algorithms in multiprocessor systems
- Task scheduling of parallel programs to optimize communications for cluster of SMPs
This page was built for publication: Optimized parallelization heuristic for task scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111790)