Extending IC-scheduling via the sweep algorithm

DOI10.1016/j.jpdc.2009.11.001zbMath1233.68049OpenAlexW2002290086MaRDI QIDQ666039

Grzegorz Malewicz, Gennaro Cordasco, Arnold L. Rosenberg

Publication date: 7 March 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.2009.11.001

zbMATH Keywords

grid computingglobal computingIC-schedulingIC-scheduling theoryinternet-based computingscheduling dags

Mathematics Subject Classification ID

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

Related Items (5)

ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA ⋮ On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules ⋮ Extending IC-scheduling via the sweep algorithm ⋮ On clustering \textsc{Dag}s for task-hungry computing platforms ⋮ Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts

Uses Software

• GRID Infoware
• DAGMan

Cites Work

• Unnamed Item
• Unnamed Item
• Extending IC-scheduling via the sweep algorithm
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Benchmarking and comparison of the task graph scheduling algorithms
• Toward maximizing the quality of results of dependent tasks computed unreliably
• An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
• A computational economy for grid computing and its implementation in the Nimrod-G resource broker

This page was built for publication: Extending IC-scheduling via the sweep algorithm