Comparison of Simulated GRID Scheduling Algorithms

University of Zilina Faculty of Management Science and Informatics, penka.martincova@fri.uniza.sk, michal.zabovsky@fri.uniza.sk Abstract : Grid computing has emerged as the next-generation parallel and distributed computing that aggregates dispersed heterogeneous resources for solving a range of large-scale parallel applications in science, engineering and commerce [1]. Grid scheduling is one of important problems, which has to be resolved by grid researchers. It is a complex problem, which aims to map existing tasks to accessible storage and computational resources in order to get their effective utilization. Since scheduling problem is NP-hard, mostly it’s not possible to find optimal solution and heuristics are used. Simulation is an important tool used for testing the performance of heuristic solutions proposed. This paper presents simulation results of scheduling algorithms.