On scheduling series-parallel DAGs to maximize area

DOI10.1142/S0129054114500245zbMATH Open1302.68039OpenAlexW2053350909MaRDI QIDQ2929638FDOQ2929638

Authors: Gennaro Cordasco, Arnold L. Rosenberg 

Publication date: 14 November 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054114500245

Recommendations

• On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
• Scheduling DAGs opportunistically: the dream and the reality circa 2016
• Scheduling tree dags on parallel architectures
• Stochastic DAG scheduling using a Monte Carlo approach
• Dynamic scheduling of parallel computations

zbMATH Keywords

cloud computingdesktop gridsvolunteer computingDAG-scheduling for dynamically heterogeneous platformsdynamically heterogeneous computing platformsseries-parallel DAGs

Mathematics Subject Classification ID

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

Cites Work

• Scheduling multithreaded computations by work stealing
• The Recognition of Series Parallel Digraphs
• On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
• Extending IC-scheduling via the sweep algorithm
• Space-Efficient Scheduling of Multithreaded Computations

Cited In (3)

• On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
• Extending IC-scheduling via the sweep algorithm
• Scheduling series-parallel task graphs to minimize peak memory

This page was built for publication: On scheduling series-parallel DAGs to maximize area

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929638)