Iterative list scheduling for heterogeneous computing
From MaRDI portal
Recommendations
- List scheduling with duplication for heterogeneous computing systems
- Directed acyclic task graph scheduling for heterogeneous computing systems by dynamic critical path duplication algorithm
- Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication
- Scheduling and optimizing algorithm for parallel tasks in heterogeneous distributed computing systems
- A high performance algorithm for static task scheduling in heterogeneous distributed computing systems
Cited in
(11)- List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity
- List scheduling with duplication for heterogeneous computing systems
- Stochastic DAG scheduling using a Monte Carlo approach
- Directed acyclic task graph scheduling for heterogeneous computing systems by dynamic critical path duplication algorithm
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
- Communication contention in APN list scheduling algorithm
- An improved list-based task scheduling algorithm for fog computing environment
- Posterior Task Scheduling Algorithms for Heterogeneous Computing Systems
- A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
- DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems
- Reliability-aware scheduling strategy for heterogeneous distributed computing systems
This page was built for publication: Iterative list scheduling for heterogeneous computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779735)