ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA

DOI10.1142/S0129054114500245zbMath1302.68039OpenAlexW2053350909MaRDI QIDQ2929638

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

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)

Related Items (max. 100)

Scheduling series-parallel task graphs to minimize peak memory

Cites Work

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

This page was built for publication: ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA