ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems
From MaRDI portal
Publication:2218451
Recommendations
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- Scheduling loosely connected task graphs.
- Optimal virtual cluster-based multiprocessor scheduling
- TWO PRECEDENCE-RELATED TASK-SCHEDULING ALGORITHMS
- Task scheduling with precedence constraints to minimize the total completion time
Cites work
- scientific article; zbMATH DE number 975350 (Why is no real title available?)
- A clustering algorithm for multiprocessor environments using dynamic priority of modules
- A high performance algorithm for static task scheduling in heterogeneous distributed computing systems
- A machine assignment mechanism for compile-time list-scheduling heuristics
- Adaptive Scheduling of Task Graphs with Dynamic Resilience
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- Benchmarking and comparison of the task graph scheduling algorithms
- List scheduling with duplication for heterogeneous computing systems
- Parallel Gaussian elimination on an MIMD computer
- Towards an Architecture-Independent Analysis of Parallel Algorithms
Cited in
(2)
This page was built for publication: ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218451)