The week's pick
Reseach Article
A Comparative Study on Grid Scheduling Algorithms
| International Journal of Applied Information Systems |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 3 - Number 8 |
| Year of Publication: 2012 |
| Authors: J. Shanthini, K. R. Shankarkumar |
10.5120/ijais12-450527
|
J. Shanthini, K. R. Shankarkumar . A Comparative Study on Grid Scheduling Algorithms. International Journal of Applied Information Systems. 3, 8 ( August 2012), 1-4. DOI=10.5120/ijais12-450527
Abstract
The grid is known to be a next generation computing technology; enables coordinated sharing of computing resources, which are geographically distributed. The scheduling is known to be an NP-hard problem for the last decades. Here we have compared different grid scheduling algorithms like ATC, WMDD, WMS, WMSPT, with the objective to minimize the total tardiness of the jobs. The simulation results show that the WMSPT, WMDD and ATC algorithm yields better perform tardiness minimization and WMSPT gives good minimization and lower wait time.
References
- Foster and C. Kesselman (editors), The Grid: Blueprint for a Future Computing
- Infrastructure, Morgan Kaufmann Publishers, USA, 1999.
- http://searchdatacenter. techtarget. com/definition/grid-computing
- www. globus. com
- R. Braun, H. Siegel, N. Beck, L. Boloni, M. Maheswaran, A. Reuther, J. Robertson,M. Theys, B. Yao, D. Hensgen and R. Freund, A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems, in J. of Parallel and Distributed Computing, vol. 61, No. 6, pp. 810-837, 2001
- Noriyuki Fujimoto, Kenichi Hagihara, A comparison among grid scheduling algorithms for independent coarse-grained tasks, Proceedings of the 2004 International Symposium on Applications an the Internet Workshops (SAINTW'04), Vol. 26–30, January 2004, pp. 674–680
- Hak Du Kim, Jin Suk Kim, An online scheduling algorithm for grid computing
- systems, GCC (2), LNCS 3033, Springer, Shanghai, China, 2004, pp. 34–39.
- M. Wu, W. Shu and H. Zhang, Segmented Min-Min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems, in Proc. of the 9th Heterogeneous Computing Workshop (HCW'00), pp. 375--385, Cancun, Mexico, May 2000.
- X. He, X. Sun and G. Laszewski, A QoS Guided Min-Min Heuristic for Grid Task Scheduling, in J. of Computer Science and Technology, Special Issue on Grid Computing, Vol. 18, No. 4,pp. 442--451, July 2003.
- L. Y. Tseng, Y. H. Chin , S. C. Wang, The anatomy study of high performance task scheduling algorithm for Grid computing system, Computer Standards & Interfaces 31 (2009) 713–722
- N. Bahaji , M. E. Kuhl, A simulation study of new multi-objective composite dis patching rules, CONWIP, and push lot release in semiconductor fabrication, Journal of Production Research, 46:14, 3801 — 3824
- N. Tonellotto, R. Yahyapour and Ph. Wieder , Towards a standards-based Grid Scheduling Architecture, coreGRID Technical Report No. TR-00015, Sep. 13. 2005
- Dalibor Klusá?ek and Hana Rudová. Alea 2 - Job Scheduling Simulator. In proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques (SIMUTools 2010), ICST, 2010.
- Ibrahim H. Osman, Hocine Belouadah,Krzysztof Fleszar and Maysaa saffar, Hybrid of weighted minimum slack and shortest Processing time dispatching rule for the the total weighted tardiness single machine scheduling problem with availability constraints. , Multidisciplinary International Conference on scheduling: Theory and Applications (MISTA 2009)
Index Terms
Keywords