Communication contention in APN list scheduling algorithm
From MaRDI portal
Publication:2267003
Recommendations
- scientific article; zbMATH DE number 1875362
- List scheduling with and without communication delays
- Efficient communication contention aware scheduling in heterogeneous system
- Scheduling and congestion control for wireless and processing networks
- Scheduling in wireless networks
- Scheduling and congestion control for wireless internet
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1875362 (Why is no real title available?)
- scientific article; zbMATH DE number 975350 (Why is no real title available?)
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- A two-pass scheduling algorithm for parallel programs
- An analysis of parallel heuristics for task allocation in multicomputers
- An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems.
- Iterative list scheduling for heterogeneous computing
- Optimal Scheduling Strategies in a Multiprocessor System
- Towards an Architecture-Independent Analysis of Parallel Algorithms
Cited in
(5)- scientific article; zbMATH DE number 1875362 (Why is no real title available?)
- Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems
- List scheduling with duplication for heterogeneous computing systems
- Efficient communication contention aware scheduling in heterogeneous system
- Reliability-aware scheduling strategy for heterogeneous distributed computing systems
This page was built for publication: Communication contention in APN list scheduling algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267003)