Optimal schedules for d-D grid graphs with communication delays
From MaRDI portal
(Redirected from Publication:4593968)
Recommendations
- Scheduling 2-dimensional grids with large communication delays
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
- A heuristic for scheduling task graphs with communication delays onto multiprocessors
- On the complexity of scheduling with large communication delays
- scientific article; zbMATH DE number 1061006
- scientific article; zbMATH DE number 2086776
- scientific article; zbMATH DE number 1156619
- Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
- Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
- An EPTAS for scheduling fork-join graphs with communication delay
Cited in
(5)- Minimizing the schedule length for a parallel 3D-grid precedence graph
- Optimal scheduling for UET/UET-UCT generalized \(n\)-dimensional grid task graphs
- Scheduling 2-dimensional grids with large communication delays
- Some models for scheduling parallel programs with communication delays
- Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
This page was built for publication: Optimal schedules for d-D grid graphs with communication delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593968)
