Issue No. 07 - July (2009 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.11
Pierre-François Dutot , Université Pierre Mendês-France, Grenoble
Tchimou N'Takpé , Nancy University / LORIA, Nancy
Frédéric Suter , Nancy University / LORIA, Nancy
Henri Casanova , University of Hawaii at Manoa, Honolulu
Applications structured as parallel task graphs exhibit both data and task parallelism and arise in many domains. Scheduling these applications efficiently on parallel platforms has been a long-standing challenge. In the case of a single homogeneous platform, such as a cluster, results have been obtained both in theory, i.e., guaranteed algorithms, and, in practice, i.e., pragmatic heuristics. Due to task parallelism, these applications are well suited for execution on distributed platforms that span multiple clusters possibly in multiple institutions. However, the only available results in this context are nonguaranteed heuristics. In this paper, we develop a scheduling algorithm, MCGAS, which is applicable to multicluster platforms that are almost homogeneous. Such platforms are often found as large subsets of multicluster platforms. Our novel contribution is that MCGAS computes task allocations so that a (tunable) performance guarantee is provided. Since a performance guarantee does not necessarily imply good average performance in practice, we also compare MCGAS with a recently proposed nonguaranteed algorithm. Using simulation over a wide range of experimental scenarios, we find that MCGAS leads to better average application makespans than its competitor.
Mixed parallelism, parallel task graph scheduling, performance guarantee, multicluster platform.
P. Dutot, H. Casanova, F. Suter and T. N'Takpé, "Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms," in IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 940-952, 2009.