On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules

DOI10.1016/J.JPDC.2012.06.007zbMath1248.68110OpenAlexW2080162665MaRDI 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

zbMATH Keywords

cloud computing\textsc{DAG} schedulingdesktop gridsscheduling for dynamically heterogeneous platformsvolunteer computing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (1)

ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA

Uses Software

• DAGMan

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

This page was built for publication: On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules