Open Access Open Access  Restricted Access Subscription or Fee Access

A Survey on Grid Scheduling Algorithms-Problems and Directions

G. Saravanan, Dr.V. Gopalakrishna

Abstract


Grid computing is one of the fast growing kind of network communication and at present grid computing is an active field of doing research. The major objective of Grid computing is to combine the power of extensively distributed resources, and offer non-trivial services to all the users according to their needs. In order to realize this objective, an effective Grid scheduling algoithm is a fundamental part of the Grid computing. Scheduling plays an significant role for the effective performance of the Grid computing. Although middleware support for grid computing has been the major field of research, scheduling algoithms for the grid computing have not been much investigated. It is necessary to take care of the waiting time, throughput and response times of jobs together with the processor utilization for the purpose of assessing the performance of grid scheduling algoithms. In this survey, the challenges for Grid scheduling are identified and several Grid scheduling algorithms are discussed from different aspects. Their advantages and disadvantages are pointed out and discussed the various problems found in the existing Grid Scheduling algorithms and provided directions for future developments.

Keywords


Grid Computing System, Earliest Deadline First (EDF), First Come First Serve (FCFS), Heterogeneity, Autonomy

Full Text:

PDF

References


R. Buyya and D. Abramson and J. Giddy and H. Stockinger, “Economic Models for Resource Management and Scheduling in Grid Computing”, Journal of Concurrency and Computation: Practice and Experience, Vo. 14, No. 13-15, Pp. 1507-1542, Wiley Press, 2002.

Foster, I., Kesselman, C. and Tuecke, S, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations”, International Journal of High Performance Computing applications, Vol. 15, No. 3, Pp. 200-222, 2001.

F. Berman, G. Fox and T. Hey, “Grid Computing - Making the Global Infrastructure a Reality”, John Wiley & Sons, Ltd, ISBN: 0-470-85319-0, 2002.

Ann Chervenak, “The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Data Sets”, Journal of Network and Computer Applications, 2001.

Fangpeng Dong and Selim G. Akl, “Scheduling Algorithms for Grid Computing”: State of the Art and Open Problems, School of Computing, Queen's University Kingston, Ontario 2006.

F. Berman, “High-Performance Schedulers, chapter in The Grid: Blueprint for a Future Computing Infrastructure”, Edited by I. Foster and C. Kesselman, Morgan Kaufmann Publishers, 1998.

Lee, Y.C and Zomaya, A.Y, “Practical Scheduling of Bag-of-Tasks Applications on Grids with Dynamic Resilience”, IEEE Transactions on Computers, Vol. 56, No. 6, Pp. 815 – 825, 2007.

Batista, D.M and da Fonseca, N.L.S, “Scheduling Grid Tasks in Face of Uncertain Communication Demands”, IEEE Transactions on Network and Service Management, Vol. 8, No. 2, Pp. 92 – 103, 2011.

Spooner, D.P, Jarvis, S.A, Cao, J, Saini, S and Nudd, G.R, “Local grid scheduling techniques using performance prediction”, IEE Proceedings -Computers and Digital Techniques, Vol. 150, No. 2, Pp. 87 – 96, 2003.

Doulamis, N.D, Doulamis, A.D, Varvarigos, E.A and Varvarigou, T.A, “Fair Scheduling Algorithms in Grids”, IEEE Transactions on Parallel and Distributed Systems, Vol. 18, No. 11, Pp. 1630 – 1648, 2007.

Jin Xu, Lam, A.Y.S and Li, V.O.K, “Chemical Reaction Optimization for Task Scheduling in Grid Computing”, IEEE Transactions on Parallel and Distributed Systems, Vol. 22, No. 10, Pp. 1624 – 1631, 2011.

Suchang Guo, Hong-Zhong Huang, Zhonglai Wang and Min Xie, “Grid Service Reliability Modeling and Optimal Task Scheduling Considering Fault Recovery”, IEEE Transactions on Reliability, Vol. 60, No. 1, Pp. 263 – 274, 2011.

Zhenyu Sun, Wei Guo, Zhengyu Wang, Yaohui Jin, Weiqiang Sun, Weisheng Hu and Chunming Qiao, “Scheduling Algorithm for Workflow-Based Applications in Optical Grid”, Journal of Lightwave Technology, Vol. 26, No. 17, Pp. 3011 – 3020, 2008.

Wei-Neng Chen and Jun Zhang, “An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements”, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, Vol. 39, No. 1, Pp. 29 – 43, 2009.

Prodan, R and Wieczorek, M, “Bi-Criteria Scheduling of Scientific Grid Workflows”, IEEE Transactions on Automation Science and Engineering, Vol. 7, No. 2, Pp. 364 – 376, 2010.

Xubin Luo and Bin Wang, “Integrated Scheduling of Grid Applications in WDM Optical Light-Trail Networks”, Journal of Lightwave Technology, Vol. 27, No. 12, Pp. 1785 – 1795, 2009.

Ranaldo, N and Zimeo, E, “Time and Cost-Driven Scheduling of Data Parallel Tasks in Grid Workflows”, IEEE Systems Journal, Vol. 3, No. 1, Pp. 104 – 120, 2009.

Min Zhu, Wei Guo, Shilin Xiao, Wei, A, Yaohui Jin, Weisheng Hu and Geller, B, “Availability-Driven Scheduling for Real-Time Directed Acyclic Graph Applications in Optical Grids”, IEEE/OSA Journal of Optical Communications and Networking, Vol. 2, No. 7, Pp. 469 – 480, 2010.

Korkhov, V.V, Moscicki, J.T and Krzhizhanovskaya, V.V, “The User-Level Scheduling of Divisible Load Parallel Applications With Resource Selection and Adaptive Workload Balancing on the Grid”, IEEE Systems Journal, Vol. 3, No. 1, Pp. 121 – 130, 2009.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.