The week's pick
Reseach Article
FrameWork for Job Scheduling in Grid Environment
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 38 - Number 7 |
| Year of Publication: 2012 |
| Authors: Deepti Malhotra, Devanand |
10.5120/4703-6861
|
Deepti Malhotra, Devanand . FrameWork for Job Scheduling in Grid Environment. International Journal of Computer Applications. 38, 7 ( January 2012), 42-44. DOI=10.5120/4703-6861
Abstract
Job scheduling is a fundamental issue in achieving a high performance on the Grids. In grid computing several applications require numerous resources for execution which are not often available for them, thus presence of a scheduling system to allocate resources to input jobs is vital. This paper introduces a model and a job scheduling algorithm in grid computing environments. Computational grids have the potential for solving Large-scale scientific problems using heterogeneous and geographically distributed resources. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and a job-scheduling algorithm. The research work introduces NSA (node-selection algorithm) at the global scheduler and the PSA (processor selection algorithm) at the local scheduler. The NSA is based on the rule that the light-loaded processing node is selected for the job allocation. This technique fetches the jobs from the Global job queue that is ready to execute and assign these jobs to the best nodes of the grid. The PSA (processor selection algorithm) schedule the job to the processor of a selected node having maximum available CPU resource (ACR).The algorithm has been tested in a simulated grid environment.
References
- I. Foster, C. Kesselman, S. Tuecke. 2001. The Anatomy of the Grid: Enabling Scalable Virtual Organizations.International Journal Supercomputer Applications, 15(3).
- Rajkummar Buyya.2002.Economic-based Distributed Resource Management and Scheduling for grid computing.PhD thesis, Monash university, Melborn, Australia, (April 2002)
- M. Aggarwal, R.D. Kent and A. Ngom.2005. Genetic Algorithm Based Scheduler for Computational Grids.In Proc. of the 19th Annual International Symposium on High Performance Computing Systems and Applications (HPCS’05), pp.209- 215(May 2005.), Guelph, Ontario Canada.
- Jamshid Bagherzadeh,Mojtaba MadadyarAdeh.2009. An Improved Ant Algorithm for Grid Scheduling Problem.In Proceedings of the 14th International CSI Computer Conference .
- Fangpeng Dong and Selim G. Akl ,School of Computing, Queen’s University Kingston, Ontario. 2006 .Technical Report No. 2006-504. Scheduling Algorithms for Grid Computing: State of the Art and Open Problems,
- D Wright.2001. Cheap Cycles from the Desktop to the Dedicated Cluster: Combining Opportunistic and Dedicated Scheduling with Condor.In Proceeding of HPC Revolution 01, Illinois.
- K. Al-Saqabi, S. Sarwar, and K. Saleh.1997. Distributed gang scheduling in networks of heterogeneous workstations, Computer Communications Journal, pp.338-348.
- Maheswaran M, Ali S, Siegel H J, et al.1999.Dynamic mapping of a class of independent tasks on to heterogeneous computing systems. In the 8th IEEE Heterogeneous Computing Workshop (HCW '99),San Juan, Puerto Rico,(Apr. 1999), pp.30-44.
- XiaoShan He, XianHe Sun, and Gregor von Laszewski.2003.QoS Guided Min-Min Heuristic for Grid Task Scheduling, Computer Science and Technology, 18(4):442-451.
- Malarvizhi.N, Rhymend Uthariaraj. 2008. A Broker-Based Approach to Resource Discovery and Selection in Grid Environments. In IEEE International Conference on Computer and Electrical Engineering, pp. 322-326.
- Feitelson, D.G.Rudolph R. 1995. Parallel Job Scheduling: Issues and Approaches, Springer Lecture Notes in Computer Science, vol 949, pp. 1- 18.
- M. Harchol-Balter, T. Leighton, D. Lewin.1999.Resource Discovery in Distributed Networks. In18th ACM Symposium on Principles of Distributed Computing.
- Anne Benoit, Murray Cole, Stephen Gilmore and Jane Hillston.2005. Enhancing the effective utilization of Grid clusters by exploiting on-line performability analysis.In IEEE International symposium on Cluster Computing and the Grid, pp.317-324.
- Shun-Li Ding, Jing-Bo Yuan and Ji-U-Bin Ju.2004.An algorithm for agent based task scheduling in grid environments, proceedings of International Conference on Machine Learning and Cybernetics, pp2809- 2814.
- Huyn zhang, chanle wu, Q.xiong, and L.Wu,G. Ye. 2006. Research on an Effective Mechanism of Task Scheduling in Grid Environment.In IEEE, Fifth International Conference on Grid and Cooperative Computing (GCC’06).
- A.Anjum, R. McClatchey, H. Stockinger, A. Ali, I. Willers, M. Thomas, M. Sagheer, K. Hasham, and O.Alvi.2006. DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling. In Proc. Second IEEE International Conference On e-Science and grid computing (e- Science’06).
- T.Wang, X. zhou, Q. Liu, Z. Yang, and Y. Wang.2006. An adaptive Resource Scheduling Algorithm for Computational Grid.In IEEE Asiapacific Conference on Services Computing (APSCC’06).
- Jie Song, Chee-Kian Koh, Simon See, and Gay Kheng.2005. Performance Investigation of Weighted Meta-scheduling Algorithm for Scientific Grid.The 4th International Conference on Grid and Cooperative Computing (GCC 2005) LNCS 3795,pp.1021-1030.
- F. Kon, R. Campbell, M. Mickunas, and K. Nahrstedt.2000. 2K: A distributed operation system for dynamic heterogeneous environments. In: Proc. 9th IEEE Int'l Symposium on High Performance Distributed Computing (HPDC '00).
- P. Chandra, A. Fisher, C. Kosak.1998. Darwin: Customizable resource management for value-added network services. In: Proc. 6th IEEE Int'l Conference on Network Protocols.
- S. Chapin, J. Karpovich and A. Grimshaw. 1999. The Legion resource management system. In: Proc. 5th Workshop on Job Scheduling Strategies for Parallel Processing.
- Blazewicz, J. Brauner, and Finke. 2004. Scheduling with Discrete Resource Constraints, In Lueng (2004). chapter 23.
Index Terms
Keywords