An Effective Approach to Job Scheduling in Decentralized Grid Environment

Abstract

Scheduling of jobs and resource management are the important challenging work in a grid computing environment. Processing time minimization of the jobs arriving at any computer site in a grid computing system is one of the major objectives in the research area of computing. In this paper, we propose a decentralized grid system model as a collection of clusters. We then introduce a decentralized job scheduling algorithms which performs intra cluster and inter cluster (grid) job scheduling. In this paper, we apply Divisible Load Theory (DLT) and Least Cost Method (LCM) to model the grid scheduling problem involving multiple resources within a intra cluster and inter cluster grid environment. The proposed decentralized hybrid job scheduling algorithm is an improved form of the DLT and LCM method. The result shows that the gap between the decentralized hybrid job scheduling algorithm and centralized job scheduling algorithm is widening as the number of jobs is increased.

Reference

• Syed Nasir Mehmood Shah, Ahmad Kamil Bin Mahmood, and Alan Oxley 2010, “Hybrid Resource Allocation for Grid Computing”, in Proceedings of the IEEE Second International Conference on Computer Research and Development, 426 – 431.
• D.Yu, T.G.Robertazzi 2003, “Divisible Load Scheduling for Grid Computing”, in Proceedings of the International Conference on Parallel and Distributed Computing Systems.
• Murugesan, and C.Chellappan 2009, “An Economical Model for Optimal Distribution of Loads for Grid Applications”, in Internal Joural of Computer and Network Security, Vol.1, No.1.
• P.K.Suri, and Manpreet Singh 2010, “An Efficient Decentralized Load Balancing Algorithm for Grid”, in Proceeding ofStar the IEEE Second International Advance Computing Conference,10 – 13.
• M.Balajee, B.Suresh, M.Suneetha, V.Vasudha Rani, and G.Veerraju 2010,”Preemptive Job Scheduling with Priorities and Starvation cum Congestion Avoidance in Clusters ”, in Proceedings of the IEEE Second International Conference on Machine Learning and Computing , 225 - 229.
• N.Malarvizhi, and Dr.V.Rhymend Uthaiaraj 2009, “A Minimum Time to Release Job Scheduling Algorithm in Computational Grid Environment”, in Proceedings of the 5th IEEE Joint International Conference on INC, IMS, and IDC, 13 - 18.
• I.Foster, and C.Kesselman 1999,”The Grid: Blueprint for a Future Computing Infrastructure”, Morgan Kaufmann Publishers,USA.
• M.Baker, R.Buyya, and D.Lafornza 2002,”Grids and Grid Technologies for Wide-area Distributed Computing”, Software-Practice and Experience, Vol.32, No.15, 1437 – 1466.
• I.Foster, C.Kesselman, and S.Tuecke 2001,”The Anatomy of the Grid: Enabling Scalable Virtual Organizations”, International Journal on High Performance Computing Applications, Vol.15, No.3, 200 – 222.
• G.Manimaran, and C.Siva Ram Murthy 1998,”An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-time Systems”, IEEE Transactions on Parallel and Distributed Systems, Vol.9, No.3, 312 -319.
• N.Amano, J.O.Gama, and F.Silva 2003, “Exploiting Parallelism in Decision Tree Induction’, in Proceedings from the ECML/PKDD Workshop on Parallel and Distributed Computing for Machine Learning, 13 – 22.
• V.Bharadwaj, D.Ghose, and T.G.Robertazzi 2008,”Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems”, Cluster Computing, Vol.6, No.1, 7 – 17.
• M.Chetper, F.Claeys, B.Dhoedt, F.De Turck, P.Vanrollegham, and P.Demeester 2006,”Dynamic Scheduling of Computationally Intensive Applications on Unreliable Infrastructures”, in Proceedings of the Second European Modeling and Simulation Symp.
• C.Grimme, J.Lepping, A.Papaspyrou, P.Wieder, R.Yahyapour, A.Oleksiak, O.Waldrich, and W.Ziegler 2007, “Towards a Standards-based Grid Scheduling Architecture”, CoreGRID Technical Report TR-0123, Institute on Resource Management and Scheduling.
• K.Kurowski, J.Nabrzski, A.Oleksiak, and J.Weglarz 2006, “Scheduling Jobs on the Grid-Multicriteria Approach”, Computational Methods in Science and Technology, Vol.12, No.2, 123 – 138.

Index Terms

Key words