A Bi-criteria Algorithm for Scheduling Parallel Task Graphs on Clusters

Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a long-standing challenge. In the case of a single homogeneous cluster, most of the existing algorithms focus on the reduction of the application completion time (makespan). But in presence of resource managers such as batch schedulers and due to accentuated pressure on energy concerns, the produced schedules also have to be efficient in terms of resource usage. In this paper we propose a novel bi-criteria algorithm, called biCPA, able to optimize these two performance metrics either simultaneously or separately. Using simulation over a wide range of experimental scenarios, we find that biCPA leads to better results than previously published algorithms.

• Type: Conference
• Year: 2010
• Where: CCGRID
• Authors: Frédéric Desprez, Frédéric Suter
• Keywords: Application Completion Time, CCGRID 2010, Distributed And Parallel Computing, Parallel Task Graphs, Single Homogeneous Cluster