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

DOI10.1016/J.JPDC.2012.06.007zbMATH Open1248.68110OpenAlexW2080162665MaRDI QIDQ456005FDOQ456005

Authors: Gennaro Cordasco, Rosario De Chiara, Arnold L. Rosenberg 

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

Recommendations

• On scheduling series-parallel DAGs to maximize area
• Scheduling DAGs opportunistically: the dream and the reality circa 2016
• Implementation and experiments with an algorithm for parallel scheduling of complex dags under uncertainty (extended abstract)
• Scheduling tree dags on parallel architectures

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)

Cites Work

• Introduction to algorithms.
• Optimization, approximation, and complexity classes
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Optimal Linear Ordering
• Title not available (Why is that?)
• Extending IC-scheduling via the sweep algorithm
• On clustering \textsc{Dag}s for task-hungry computing platforms

Cited In (3)

• On scheduling series-parallel DAGs to maximize area
• Extending IC-scheduling via the sweep algorithm
• Scheduling DAGs opportunistically: the dream and the reality circa 2016

Uses Software

• DAGMan

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)