Concurrent scheduling of parallel task graphs on multi-clusters using constrained resource allocations

Tchimou N'Takpé, Frédéric Suter

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

30 Scopus citations

Abstract

Scheduling multiple applications on heterogeneous multi-clusters is challenging as the different applications have to compete for resources. A scheduler thus has to ensure a fair distribution of resources among the applications and prevent harmful selfish behaviors while still trying to minimize their respective completion time. In this paper we consider mixedparallel 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 application and evaluate them over a wide range of scenarios.

Original languageEnglish
Title of host publicationIPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
DOIs
StatePublished - 2009
Externally publishedYes
Event23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009 - Rome, Italy
Duration: May 23 2009May 29 2009

Publication series

NameIPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Conference

Conference23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009
Country/TerritoryItaly
CityRome
Period05/23/0905/29/09

Fingerprint

Dive into the research topics of 'Concurrent scheduling of parallel task graphs on multi-clusters using constrained resource allocations'. Together they form a unique fingerprint.

Cite this