On cluster resource allocation for multiple parallel task graphs

DOI10.1016/J.JPDC.2010.08.017zbMATH Open1233.68106OpenAlexW2168694501MaRDI QIDQ666258FDOQ666258

Authors: Henri Casanova, F. Desprez, Frédéric Suter 

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.2010.08.017

Recommendations

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• scientific article; zbMATH DE number 2087831
• On-line scheduling of parallel jobs in heterogeneous multiple clusters
• scientific article; zbMATH DE number 1894382
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints

zbMATH Keywords

clusterresource allocationmulti-criteria schedulingparallel task graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fairness in parallel job scheduling
• Euro-Par 2004 Parallel Processing

Cited In (4)

• Title not available (Why is that?)
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• On clustering \textsc{Dag}s for task-hungry computing platforms
• Complexity analysis of new task allocation problem using network flow method on multicore clusters

Uses Software

• SIMGRID

This page was built for publication: On cluster resource allocation for multiple parallel task graphs

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