CFP last date
20 May 2024
Reseach Article

Review on Grid Task Scheduling in Distributed Heterogeneous Environment

by M. Hemamalini
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 40 - Number 2
Year of Publication: 2012
Authors: M. Hemamalini
10.5120/4929-7159

M. Hemamalini . Review on Grid Task Scheduling in Distributed Heterogeneous Environment. International Journal of Computer Applications. 40, 2 ( February 2012), 24-30. DOI=10.5120/4929-7159

@article{ 10.5120/4929-7159,
author = { M. Hemamalini },
title = { Review on Grid Task Scheduling in Distributed Heterogeneous Environment },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 40 },
number = { 2 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 24-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume40/number2/4929-7159/ },
doi = { 10.5120/4929-7159 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:27:02.142676+05:30
%A M. Hemamalini
%T Review on Grid Task Scheduling in Distributed Heterogeneous Environment
%J International Journal of Computer Applications
%@ 0975-8887
%V 40
%N 2
%P 24-30
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Computational grid is a potential technology mainly used for distributed environment. The major issues related with Grid are resource discovery, heterogeneity, fault tolerance and task scheduling. Grid task scheduling is an integrated component of computing which effectively utilizes the idle time of resources. Efficient scheduling algorithm is needed to utilize the resources effectively and reduce the overall completion time. This paper analyzes the performance of scheduling algorithms from different point of view such as makespan, execution time, completion time and load balancing. First, the general view of World Wide Web grid computing environment and its functions are discussed. Then this paper examines the performance of four scheduling algorithms such as Min-Min, Max-Min, Minimum Completion Time and Minimum Execution Time. Based on the comparative study of various algorithms, some common issues are proposed. The conventional Max-Min grid task scheduling algorithm effectively utilizes the resources and minimizes the makespan than other scheduling algorithms. This survey shows that Max-Min grid task scheduling algorithm outperforms the other algorithms in both task and resource heterogeneous environment.

References
  1. Ian Foster, Carl Kesselman, Steven Tuecke. 2001. The Anatomy of the Grid Enabling Scalable Virtual Organizations. International Journal of Supercomputer Applications.
  2. Rajkumar Buyya and Sri kumar Venugopal. 2005. A Gentle Introduction to Grid Computing and Technologies Computer Society of India.
  3. Braun, T.D., Siegel, H.J., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., et al. 2001. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, Vol. 61, No. 6, pp.810–837.
  4. Buyya, R., Abramson, D. and Giddy, J. Nimrod/G: architecture of a resource Management and scheduling system in a global computational Grid. 2000. High Performance Computing Asia 2000, Beijing, China, May 14-17, pp.283-289.
  5. HE Xiaoshan, Xian –He sun, Gregor von Laszewski. Qos Guided Min-Min Heuristic for Grid Task Scheduling. International Journal of Computer Applications.
  6. Raksha Sharma, Vishnu Kant Soni, Manoj Kumar Mishra, Prachet Bhuyan. 2010. A Survey of Job Scheduling and Resource Management in Grid Computing, World Academy of Science, Engineering and Technology 64.
  7. T.Kokilavani, Dr.D.I.George Amalarethinam. Load Balanced Min-Min Algorithm for static Meta – Task Scheduling in Grid Computing. 2011. International Journal of Computer Applications, Volume 20 – No.2.
  8. Kamalam.G.K and Muralibhaskaran.V. A New Heuristic Approach:Min-Mean Algorithm For Scheduling Meta-Tasks On Heterogenous Computing Systems . 2010. IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.1.
  9. Homer Wu, chong – Yen Lee , Wuu – yee chen, Tsang Lee. 2007. A Job Schedule Model based on Grid Environment. IEEE Proceedings of the First international Conference on Complex, Intelligent and software Intensive System, CISIS’07 2007.
  10. Saeed Parsa, Reza Entezari- Maleki. 2009. RASA: A New Grid Task Scheduling Algorithm. International Journal of Digital Content Technology and its Applications. Volume 3, Number 4.
  11. Sameer Singh Chauhan, R.C.Joshi. Qos Guided Heuristic Algorithms for Grid Task Scheduling. 2010. International journal of computer applications, Volume 2. No.9.
  12. Dr.K.Vivekanandan, D.Ramyachitra. A Study on Scheduling in Grid Environment. 2011. International Journal on Computer Science and Engineering, ISSN: 0975-3397 Vol. 3 No. 2.
  13. Dong. F, Luo. J, Gao. L and Ge. L. A Grid Task Scheduling Algorithm Based on QoS Priority Grouping. 2006. In the Proceedings of the Fifth International Conference on Grid and Cooperative Computing (GCC’06), IEEE.
  14. Etminani .K, and Naghibzadeh. M, A. Min-Min Max-Min Selective Algorithm for Grid Task Scheduling. 2007. The Third IEEE/IFIP International Conference on Internet, Uzbekistan.
  15. Ullah Munir. E, Li. Jianzhang, and Shengfei, Shi. QoS Sufferage Heuristic for Independent Task Scheduling in Grid. 2007. Information Technology Journal, 6 (8): 1166-1170.
  16. Geoffrey Falzon, Maozhen Li. Enhancing list scheduling heuristics for dependent job scheduling in grid computing environments. 2010. Journal of Supercomputing, Springer.
  17. Yagoubi. B, and Slimani, Y. Task Load Balancing Strategy for Grid Computing. 2007. Journal of Computer Science, Vol. 3, No. 3, pp. 186-194.
Index Terms

Computer Science
Information Sciences

Keywords

Grid Computing Task scheduling Heterogeneous computing Makespan