Browse > Article
http://dx.doi.org/10.9709/JKSS.2012.21.2.059

Dynamic Available-Resource Reallocation based Job Scheduling Model in Grid Computing  

Kim, Jae-Kwon (인하대학교 정보공학과)
Lee, Jong-Sik (인하대학교 정보공학과)
Abstract
A grid computing consists of the physical resources for processing one of the large-scale jobs. However, due to the recent trends of rapid growing data, the grid computing needs a parallel processing method to process the job. In general, each physical resource divides a requested large-scale task. And a processing time of the task varies with an efficiency and a distance of each resource. Even if some resource completes a job, the resource is standing by until every divided job is finished. When every resource finishes a processing, each resource starts a next job. Therefore, this paper proposes a dynamic resource reallocation scheduling model (DDRSM). DDRSM finds a waiting resource and reallocates an unfinished job with an efficiency and a distance of the resource. DDRSM is an efficient method for processing multiple large-scale jobs.
Keywords
Grid Computing; Dynamic Reallocation; Grid Scheduling; DRRSM;
Citations & Related Records
연도 인용수 순위
  • Reference
1 장성호 (2006), 가상화를 이용한 위탁형 그리드 서비스 거래망 모델, 석사학위논문, 인하대학교, pp. 3-4.
2 Assuncao, M. D., Costanzo, A. (2009), "Evaluating the Cost-Benefit of Using Cloud Computing to Extend the Capacity of Clusters.", In: 18th ACM International Symposium on High Performance Distributed Computing, New York, pp. 141-150.
3 Baghban, H., Rahmani, A.M. (2008), "A Heuristic on Job Scheduling in Grid Computing Environment", Proceedings of the 2008 Seventh International Conference on Grid and Cooperative Computing, Shenzhen, pp. 141-146.
4 B.P. Zeigler, et al. (1996), DEVS Framework for Modeling, Simulation, Analysis and Design of Hybrid Systems in Hybrid II, Leture Notes in CS, Springer-Verlag, Berlin, pp. 529-551.
5 Foster, I. C. Kesselman, S. Tuecke. (2001), "The Anatomy of the Gird: Enabling Scalable Virtual Organizations", International Journal of High Performance Computing Applications, Vol. 15, No. 3, pp. 200-222.   DOI   ScienceOn
6 Foster, I. and C. Kesselman. (1999), "The Grid: Blueprint for a New Computing Infrastructure", Morgan Kaufmann Publishers.
7 Foster, I. and C. Kesselan, (1997), " Globus: A Metacomputing Infrastructure Toolkit", International Journal of High Performance Computing Applications, Vol. 11, No. 2, pp. 115-128   DOI
8 Jon B. Weissman and Byoung-Dai Lee(2002), "The Virtual Service Grid: An Architecture for Delivering High-End Network Services", Concurrency: Practice and Experience, Vol. 14, No. 4, pp. 287-319.   DOI
9 Maheswaran, M., Braun, T.D., Siegel, H.J. (1999), "Heterogeneous Distributed Computing", Encyclopedia of Electrical and Electronics Engineering, J. G. Webster, editor, John Wiley & Sons, Vol. 8, pp. 679-690.
10 Munir, E.U., Li, J., Shi, S., Zou, Z., Yang, D. (2008), "MaxStd: A Task Scheduling Heuristic for Heterogeneous Computing Environment", Information Technology, Vol. 7, pp. 679-683.   DOI
11 Pang Ning Tan., Michel Steinbach and Vinpin Kumar (2007), "Introducton to Data Mining", Addison Wesley, pp.66-69.
12 Rasmus V. Rasmussen and Michael A. Trick, "Round robin scheduling-a survey", European Journal of Operational Research, pp. 617-636, 2008.
13 S. H. Bokhari. (1987), Assignment Problems in Parallel and Distributed Computing, Kluwer Academic Publisher.
14 Wood, T., Shenoy, P., Venkataramani, A., and Yousif, M.(2007), "Black-box and gray-box strategies for virtual machine migration", Proceedings of the 4th USENIX Symposium on Networked Systems Design & Implementation, pp. 229-242.
15 Sijin, H., Li, P., and Yike, G.(2011), "Real Time Elastic Cloud Management for Limited Resource", Cloud 2011 IEEE International Conference on Computing(CLOUD), Washington DC, pp. 622-629.
16 Yves, C., Ghislain, C. and Frederic, D.(2011), "Evaluation for Reallocation Heuristics for Moldable Tasks in Computational Grids", In 9th Australasian Symposium on Parallel and Distributed Computing (AusPDC 2011), Australia, pp. 1-10.