A REVIEW ON SCHEDULING ALGORITHMS FOR RESOURCE MANAGEMENT IN DATA GRIDS

Abstract

A very promising attractive computing model is Grid Computing. To provide high performance computing, grids aims to combine the geographically distributed, power of heterogeneous , multiple domain spanning computational resources. An efficient and effective scheduling system is important for achieving the capable potentials of grids. In grid environment, scheduling systems do not work for traditional distributed environments due to classes of environments which are completely dissimilar. Over various domains, making scheduling decisions involving resources is the process known as Grid Resource Scheduling. Across the management, grid scheduling must manipulate large-scale resources so there is high complication involved in it than the local resource scheduling. In this survey, discussion are made on grid scheduling algorithm with a view from different points which are objective function, QoS constraints, static vs. dynamic, strategies dealing with dynamic behavior of resources, application models, adaption and so on. This survey mainly focused a review of the subject from scheduling algorithm viewpoint rather than covering the entire grid scheduling area.