On cluster resource allocation for multiple parallel task graphs

DOI10.1016/J.JPDC.2010.08.017MaRDI QIDQ666258zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clustermulti-criteria schedulingparallel task graphsresource allocation

Mathematics Subject Classification ID

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

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

Cites work

• Euro-Par 2004 Parallel Processing
• Fairness in parallel job scheduling
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1303566 (Why is no real title available?)

Cited in

(5)

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Complexity analysis of new task allocation problem using network flow method on multicore clusters
• PHEFT: pessimistic image processing workflow scheduling for DSP clusters
• scientific article; zbMATH DE number 1830925 (Why is no real title available?)
• On clustering \textsc{Dag}s for task-hungry computing platforms

Describes a project that uses

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)