ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems
DOI10.1007/S00607-018-0636-3zbMATH Open1459.68023OpenAlexW2809109698MaRDI QIDQ2218451FDOQ2218451
Authors: Ashish Kumar Maurya, Anil Kumar Tripathi 
Publication date: 15 January 2021
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-018-0636-3
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
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- A high performance algorithm for static task scheduling in heterogeneous distributed computing systems
- Benchmarking and comparison of the task graph scheduling algorithms
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- A clustering algorithm for multiprocessor environments using dynamic priority of modules
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- Title not available (Why is that?)
- List scheduling with duplication for heterogeneous computing systems
- Adaptive Scheduling of Task Graphs with Dynamic Resilience
- Parallel Gaussian elimination on an MIMD computer
- A machine assignment mechanism for compile-time list-scheduling heuristics
Cited In (2)
Uses Software
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)
