Performance Analysis of Grid DAG Scheduling Algorithms using MONARC Simulation Tool

This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Grid systems is important especially in large scale distributed computing systems and complex applications for different research areas. We propose to evaluate DAG scheduling algorithms using simulation, an approach suitable for different scheduling algorithms using various task dependencies and considering a wide range of Grid system architectures. Our proposed solution is based on MONARC, a generic simulation framework designed for modeling large scale distributed systems. We present our work in extending the simulation platform to accommodate various DAG scheduling procedures and, as a case study, we present a critical analysis of four well known DAG scheduling strategies: CCF (Cluster ready Children First), ETF (Earliest Time First), HLFET (Highest Level First with Estimated Times) and Hybrid Remapper. The ...

• Type: Conference
• Year: 2008
• Where: ISPDC
• Authors: Florin Pop, Ciprian Dobre, Valentin Cristea
• Keywords: DAG Scheduling, DAG Scheduling Algorithms, Distributed And Parallel Computing, ISPDC 2008, Scheduling Algorithms