The week's pick
Random Articles
Reseach Article
Performance Factor based Local Scheduling for Heterogeneous Grid Environments
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 44 - Number 22 |
| Year of Publication: 2012 |
| Authors: G.sumathi, S.sathyanarayanan, R.santhosh Kumar |
10.5120/6415-8914
|
G.sumathi, S.sathyanarayanan, R.santhosh Kumar . Performance Factor based Local Scheduling for Heterogeneous Grid Environments. International Journal of Computer Applications. 44, 22 ( April 2012), 45-49. DOI=10.5120/6415-8914
Abstract
Grids [3] have emerged as paradigms for the next generation parallel and distributed computing. Computational Grid can be defined as large-scale high-performance distributed computing environments that provide access to high-end computational resources. Grid scheduling is the process of scheduling jobs over grid resources. Improving overall system performance with a lower turnaround time is an important objective of Local Grid scheduling. In this paper a Performance Factor Based Local Scheduling Algorithm is proposed. In this algorithm priority for each subtask in the Grid is assigned based on two new parameters, Computational Complexity and Performance Factor. The algorithm classifies the subtasks into high, medium and low categories based on their priority. The value for performance factor is assigned based on the value of processing power of each node i. e. Number of operations per cycle per processor and the number of instructions processed per second. The subtasks are then mapped to respective processors based on the assigned priority for execution. A subtask, which requires a very high performance factor and that exhibits high computational complexity, is given a high priority. Prioritizing the subtasks in this way can improve the performance of grid resources that in turn improve the overall efficiency of the computational grid. The effectiveness of this algorithm is evaluated through simulation results.
References
- Foster, I. , Kesselman, C: The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann ( 1998)
- Foster, I. , Kesselman, C: The Globus Project: a Status Report In Poc. IPPS/SPDP'98 Workshop on Heterogeneous Computing pp. 4-18,1998
- G. Sumathi,R. SanthoshKumar,S. Sathyanarayanan,"MidJFR Global SchedulingAlgorithm for HeterogeneousGridEnvironment",IJRTET,November,2011
- G. Sumathi, N. P. Gopalan, "PriorityBased Scheduling For Heterogeneous Grid Environments", Proc. Of 10th IEEE International Conference on Communication Systems (ICCS 2006), October, 2006.
- AmitAgarwal, Padam Kumar, Economical Task SchedulingAlgorithm for Grid Computing Systems, GJCST Classification(FOR) D. 4. 1, F. 1. 2
- T. Kokilavani, Dr. D. I. George Amalarethinam, Applying Non-Traditional Optimization Techniques to Task Scheduling in GridComputing an Overview International Journal of Research and Reviews in Computer Science (IJRRCS) Vol. 1, No. 4, December,2010
- Zhan Gao, SiweiLuo and Ding Ding, A Scheduling Approach Considering Local Tasks in the Computational Grid International Journal of Multimedia and Ubiquitous EngineeringVol. 2, No. 4, October, 2007
- Kousalya. K and Balasubramanie. P, Ant Algorithm for GridScheduling Powered by Local Search Int. J. Open Problems Compt. Math. , Vol. 1, No. 3, December 2008
- Fangpeng Dong and Selim G. Akl, Scheduling Algorithms for Grid Computing: State of the Art and Open Problems TechnicalReport No. 2006-504 .
- S. Padmavathi, S. MercyShalinie and R. Abhilaash, A MemeticAlgorithm Based Task Scheduling considering Communication Coston Cluster of Workstations Int. J. Advance. Soft Computing. Appl. ,Vol. 2, No. 2, July 2010 ISSN 2074-8523.
- Topcuoglu,H. ,S. Hariri and M. Y. Wu, "Performance Effectiveand Low Complexity Task Scheduling Algorithm scheduling forheterogeneous computing ", IEEE Transaction on Parallel andDistributed Systems, Vol. 13,No. 3,(2002).
- P. J. Huang, H. Peng, X. Z. Li, Macro adjustment based task scheduling inhierarchical Grid market, in: Proceedings of the 7th International Conferenceon Computational Science, ICCS 2007, Beijing, China, in: Lecture Notes inComputer Science, vol. 4487, Springer-Verlag, 2007, pp. 430_433.
- G. Stuer, K. Vanmechelena, J. Broeckhovea, A commodity market algorithm forpricing substitutable Grid resources, Future Generation Computer Systems 23 (5) (2007) 688_701.
- C. L. Li, L. Y. Li, QoS based resource scheduling by computational economy incomputational Grid, Information Processing Letters 98 (3) (2006) 119_126.
- R. Subrata, A. Y. Zomaya, B. Landfeldt, Artificial life techniques for loadbalancing in computational Grids, Journal of Computer and System Sciences73 (8) (2007) 1176_1190.
- C. H. Hsu, T. L. Chen, K. C. Li, Performance effective pre-scheduling strategy forheterogeneous Grid systems in the master slave paradigm, Future GenerationComputer Systems 23 (4) (2007) 569_579.
- M. Kalantari, M. K. Akbari, A parallel solution for scheduling of real timeapplications on Grid environments, Future Generation Computer Systems(2009), in press (doi:10. 1016/j. future. 2008. 01. 003).
Index Terms
Keywords