An Efficnet Job Scheduling Approach In Grid Environment Using Biggest Hole Priority Algorithm
 |
International Journal of Computer & Organization Trends (IJCOT) |  |
| © 2014 by IJCOT Journal | ||
| Volume - 4 Issue - 3 |
||
| Year of Publication : 2014 | ||
| Authors : G.Suganya. | ||
| DOI : 10.14445/22492593/IJCOT-V9P304 |
Citation
G.Suganya. "An Efficnet Job Scheduling Approach In Grid Environment Using Biggest Hole Priority Algorithm", International Journal of Computer & organization Trends (IJCOT), V4(3):17-21 May - June 2014, ISSN:2249-2593, www.ijcotjournal.org. Published by Seventh Sense Research Group.
Abstract
Advance scheduling performs predictions about future network status and about job duration of resources. This is known as meta-scheduling. This is done with the aim of not overlapping executions but without making any physical reservation. Grid resources may vary dynamically since they may fail, join or leave the Grid at any time. Algorithms for meta-scheduling in advance need to be efficient so that they can adapt themselves to dynamic changes in resource availability and user demand without affecting system and user performance. The constantly changing characteristic of the heterogeneous resources is known as dynamic resources. To make it more critical, the jobs that need to be process by these resources are arriving from different length of time and not knowing by the system until the particular jobs arrive to the system. In order to utilize these dynamic resources and jobs optimally, a scheduling strategy should be able to continually adapt to the changes and properly distribute the workload and data amounts scheduled to each node. Gap filling or backfilling is one of the techniques used to optimize First Come First Serve (FCFS) and have been used widely in scheduling area to achieve load balancing. The proposed system introduces Biggest Hole (BH) strategy. It determines which particular machine is suitable to execute the job. It places new job to the particular suitable machines schedule. It Check the current machines schedule whether a suitable gap for the new job exists. Experiemental result provides better result when compare with the exising methods.
References
[1] M. Dobber, R. van der Mei, and G. Koole, “A prediction method for job runtimes on shared processors: Survey, statistical analysis and new avenues,” Performance Evaluation, vol. 64, no. 7-8, pp. 755–781, 2007
[2] P. A. Dinda, “The statistical properties of host load,” Scientific Programming, vol. 7, no. 3-4, pp. 211–229, 1999.
[3] H. Jin, X. Shi, W. Qiang, and D. Zou, “An adaptive meta-scheduler for data-intensive applications,” Intl. Journal of Grid and Utility Computing, vol. 1, no. 1, pp. 32–37, 2005.
[4] W. Smith, I. Foster, and V. Taylor, “Scheduling with advanced reservations,” in Proc. of the 14th Intl. Parallel and Distributed Processing Symposium (IPDPS), Washington, USA, 2000
[5] P. R. Wilson, M. S. Johnstone, M. Neely, and D. Boles, “Dynamic storage allocation: A survey and critical review,” in Proc. of the Intl. Workshop on Memory Managment (IWMM), Kinross, UK, 1995
[6] M. D. De Assuncao and R. Buyya, “Performance analysis of multiple site resource provisioning: effects of the precision of availability information,” in Proc. of the 15th Intl. Conference on High Performance Computing (HiPC), Bangalore, India, 2008.
Keywords
Fragmentation Grid computing,Meta-scheduling in advance, Runtime predictions, Biggest Hole (BH) strategy