On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
From MaRDI portal
Publication:456005
Recommendations
Cites work
- scientific article; zbMATH DE number 2218057 (Why is no real title available?)
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- Extending IC-scheduling via the sweep algorithm
- Introduction to algorithms.
- On clustering \textsc{Dag}s for task-hungry computing platforms
- Optimal Linear Ordering
- Optimization, approximation, and complexity classes
Cited in
(6)- On scheduling series-parallel DAGs to maximize area
- Stochastic DAG scheduling using a Monte Carlo approach
- Steady-state scheduling
- Extending IC-scheduling via the sweep algorithm
- On clustering \textsc{Dag}s for task-hungry computing platforms
- Scheduling DAGs opportunistically: the dream and the reality circa 2016
This page was built for publication: On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456005)