On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
From MaRDI portal
Publication:456005
DOI10.1016/j.jpdc.2012.06.007zbMath1248.68110MaRDI QIDQ456005
Arnold L. Rosenberg, Gennaro Cordasco, Rosario De Chiara
Publication date: 23 October 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2012.06.007
cloud computing; \textsc{DAG} scheduling; desktop grids; scheduling for dynamically heterogeneous platforms; volunteer computing
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Extending IC-scheduling via the sweep algorithm
- On clustering \textsc{Dag}s for task-hungry computing platforms
- Optimization, approximation, and complexity classes
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- Optimal Linear Ordering