An Optimal Job Scheduling Algorithm in Computational Grids
Ramya R and Shalini Thomas. Article: An Optimal Job Scheduling Algorithm in Computational Grids. IJCA Special Issue on International Conference on Communication, Computing and Information Technology ICCCMIT(1):12-16, February 2013. Full text available. BibTeX
@article{key:article,
author = {Ramya R and Shalini Thomas},
title = {Article: An Optimal Job Scheduling Algorithm in Computational Grids},
journal = {IJCA Special Issue on International Conference on Communication, Computing and Information Technology},
year = {2013},
volume = {ICCCMIT},
number = {1},
pages = {12-16},
month = {February},
note = {Full text available}
}
Abstract
Grid computing is an emerging technology that involves coordinating and sharing of resources to carry out complex computational problems. Resource management and scheduling plays a crucial role in achieving high utilization of resources in grid computing environments. Due to heterogeneity of resources, scheduling an application is significantly complicated and challenging task in grid system. Most of the researches in this area are mainly focused on to improve the performance of the grid system. To achieve the performance in grid environment, many Job scheduling algorithms are implemented. Existing approaches of Grid scheduling doesn't give much emphasis on the performance of a Grid scheduler. This paper introduces an algorithm called Optimized Hierarchical Load Balancing Algorithm (OHLBA) for Job scheduling and Load Balancing. The proposed method is to dynamically create an optimal schedule to complete the jobs within minimum makespan. The main contributions are to balance the system load and minimize the makespan of jobs. Our proposed approach uses a Grid simulation toolkit (GridSim) to analyze the performance of OHLBA algorithm with other algorithms in terms of makespan and efficiency. Experimental results show the proposed algorithmcan perform better in a Grid environment.
References
- Y. H. Lee, S. Leu and R. S. Chang, "Improving job scheduling algorithms in a grid environment", Future generation computer systems, (2011)May.
- H. Shan, L. Oliker, W. Smith and R. Biswas, "Scheduling in Heterogeneous Grid Environments: The Effects of Data Migration", (2004).
- Ruay-Shiung Chang, Chih-Yuan Lin, Chun-Fu Lin, "An Adaptive Scoring Job Scheduling algorithm for grid computing", Future Generation Computer Systems 207 (2012) 79–89.
- Ungurean, "Job Scheduling Algorithm based on Dynamic Management of Resources Provided by Grid Computing Systems", Electronics and Electrical engineering, vol. 103, no. 7, (2010).
- Sheng-De Wang, I-Tar Hsu, Zheng-Yi Huang, "Dynamic scheduling methods forcomputational grid environments", International Conference on Parallel andDistributed Systems 1 (2005) 22–28.
- P. K. Suri, Singh Manpreet, "An efficient decentralized load balancing algorithm for grid", 2010 IEEE 2nd International Advance Computing Conference, IACC, 2010, pp. 10–13.
- S. Sharma, S. Singh and M. Sharma, "Performance Analysis of Load Balancing Algorithms", WorldAcademy of Science, Engineering and Technology, vol. 38, (2008), pp. 269-272.
- R. S. Chang, C. F. lin and J. J. Chen, "Selecting the most fitting resource for task execution", Future Generation Computer Systems, vol. 27, (2011), pp. 227-231.
- Ruay-Shiung Chang, Jih-Sheng Chang, Po-Sheng Lin, "An ant algorithm forbalanced job scheduling in grids", Future Generation Computer Systems 25 (1)(2009) 20–27. .
- R. Buyya and M. M. Murshed, "Gridsim: a toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing", Concurrency and Computation: Practice and Experience, 14:1175–1220, 2002.