Skip to Main content Skip to Navigation
Reports

Concurrent Scheduling of Parallel Task Graphs on Multi-Clusters Using Constrained Resource Allocations

Tchimou N'Takpé 1 Frédéric Suter 1, 2
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Scheduling multiple applications on heterogeneous multi-clusters is challenging as the different applications have to compete to access the resources. A scheduler thus has to ensure a fair distribution of the resources among the applications and prevent harmful selfish behaviors while still trying to minimize their respective completion time. In this study we consider mixed-parallel applications, represented by graphs whose nodes are data-parallel tasks, that are scheduled in two steps: allocation and mapping. We investigate several strategies to constrain the amount of resources the scheduler can allocate to each submitted application. This study is then evaluated over a wide range of scenarios.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00347203
Contributor : Tchimou N'Takpé <>
Submitted on : Monday, December 15, 2008 - 10:36:18 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Tuesday, June 28, 2011 - 6:19:32 PM

File

RR-6774.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00347203, version 1

Citation

Tchimou N'Takpé, Frédéric Suter. Concurrent Scheduling of Parallel Task Graphs on Multi-Clusters Using Constrained Resource Allocations. [Research Report] RR-6774, INRIA. 2008, pp.19. ⟨inria-00347203⟩

Share

Metrics

Record views

389

Files downloads

581