Minimizing Stretch and Makespan of Multiple Parallel Task Graphs via Malleable Allocations

Abstract : Many scientific applications can be structured as Parallel Task Graphs (PTGs), i.e., graphs of data-parallel tasks. Adding data-parallelism to a task-parallel application provides opportunities for higher performance and scalability, but poses scheduling challenges. We study the off-line scheduling of multiple PTGs on a single, homogeneous cluster. The objective is to optimize performance and fairness. We propose a novel algorithm that first computes perfectly fair PTG completion times assuming that each PTG is an ideal malleable job. These completion times are then relaxed so that the schedule is organized as a sequence of periods and is still close to the perfectly fair schedule. Finally, since PTGs are not perfectly malleable, the algorithm increases the execution time of all PTGs uniformly until it can successfully schedule each task in a period. Our evaluation in simulation, using both synthetic and real-world application configurations, shows that our algorithm outperforms previously proposed algorithms when considering two different performance metrics and one fairness metric.
Complete list of metadatas
Contributor : Frédéric Suter <>
Submitted on : Monday, November 8, 2010 - 3:09:27 PM
Last modification on : Thursday, August 1, 2019 - 10:42:20 AM
Long-term archiving on : Wednesday, February 9, 2011 - 3:00:42 AM


Files produced by the author(s)




Henri Casanova, Frédéric Desprez, Frédéric Suter. Minimizing Stretch and Makespan of Multiple Parallel Task Graphs via Malleable Allocations. 39th International Conference on Parallel Processing, Sep 2010, San Diego, United States. pp.71-80, ⟨10.1109/ICPP.2010.16⟩. ⟨hal-00533926⟩



Record views


Files downloads