On clustering \textsc{Dag}s for task-hungry computing platforms

DOI10.2478/S13537-011-0002-4zbMATH Open1253.68071OpenAlexW1975806056MaRDI QIDQ692974FDOQ692974

Authors: Gennaro Cordasco, Arnold L. Rosenberg 

Publication date: 6 December 2012

Published in: Central European Journal of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s13537-011-0002-4

Recommendations

• Scheduling DAGs opportunistically: the dream and the reality circa 2016
• Extending IC-scheduling via the sweep algorithm
• On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• On cluster resource allocation for multiple parallel task graphs

zbMATH Keywords

scheduling \textsc{Dag}sscheduling for heterogeneous computing platformsscheduling for task-hungry computing platforms

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Extending IC-scheduling via the sweep algorithm

Cited In (2)

• On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
• Extending IC-scheduling via the sweep algorithm

This page was built for publication: On clustering \textsc{Dag}s for task-hungry computing platforms

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