CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Heuristic Algorithm for Balancing Load in Grid Task Scheduling

by V. Vasudevan, R. Vijayalakshmi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Number 15
Year of Publication: 2013
Authors: V. Vasudevan, R. Vijayalakshmi
10.5120/11475-7085

V. Vasudevan, R. Vijayalakshmi . Heuristic Algorithm for Balancing Load in Grid Task Scheduling. International Journal of Computer Applications. 67, 15 ( April 2013), 38-41. DOI=10.5120/11475-7085

@article{ 10.5120/11475-7085,
author = { V. Vasudevan, R. Vijayalakshmi },
title = { Heuristic Algorithm for Balancing Load in Grid Task Scheduling },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 67 },
number = { 15 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 38-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume67/number15/11475-7085/ },
doi = { 10.5120/11475-7085 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:26:07.126021+05:30
%A V. Vasudevan
%A R. Vijayalakshmi
%T Heuristic Algorithm for Balancing Load in Grid Task Scheduling
%J International Journal of Computer Applications
%@ 0975-8887
%V 67
%N 15
%P 38-41
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Grid Computing is an important field that focuses on resource sharing. Grid Computing provides a secure, control and flexible resource access environment in a distributed network. One of the most critical issues in Grid Computing is efficient scheduling of the tasks. The main aim of Grid scheduling is to map the tasks onto the available processors and order their execution. Due to the dynamism and heterogeneity of the grid, an efficient scheduling algorithm that minimizes makespan with maximum resource is necessary. Efficient scheduling of jobs to the available grid resources makes effective utilization of the grid environment. Heuristic algorithms can be used for solving task scheduling problems, since it is shown to be NP-Complete. Efficiency of scheduling algorithms can be evaluated using the two important criteria makespan and resource utilization. A heuristic task scheduling algorithm that satisfies load balancing of resources on a grid environment is presented in this paper. This algorithm schedules the tasks which reduces the makespan of the jobs and increase the utilization of resources. The new heuristic task scheduling is compared with other traditional heuristics and the results are shown to predict that the new algorithm outperforms the other.

References
  1. George Amalarethinam, D. I, Vaaheeda Kfatheen. S, "Max-Min Average Algorithm for Scheduling Tasks in Grid Computing Systems", International Journal of Computer Science and Information Technologies, Vol 3 (2), 2012, 3659-3663.
  2. T. Kokilavani, Dr. D. I. George Amalarethinam. "Load Balanced Min-Min Algorithm for static Meta – Task Scheduling in Grid Computing". International Journal of Computer Applications, Volume 20 – No. 2. 2011.
  3. Geoffrey Falzon, Maozhen Li, "Enhancing list scheduling heuristics for dependent job scheduling in grid computing environments", Journal of Supercomputing, Springer, March 2010.
  4. Kamalam. G. K and Muralibhaskaran. V, , A New Heuristic Approach:Min-Mean Algorithm For Scheduling Meta-Tasks On Heterogenous Computing Systems, IJCSNS International Journal of Computer Science and Network Security, VOL. 10 No. 1, January 2010.
  5. Zhan Gao, Siwei Luo and Ding Ding, " A Scheduling Approach Considering Local Tasks in the Computational Grid" , International Journal of Multimedia and Ubiquitous Engineering, Vol 2, No. 4, October 2007.
  6. Siriluck Lorpunmanee, Mohd Noor Sap, Abdul Hanan Abdullah, and Chai Chompoo-inwai, "An Ant Colony Optimization for Dynamic Job Scheduling in Grid Environment", World Academy of Science, Engineering and Technology 29, pp. 314- 321, 2007.
  7. Etminani . K, and Naghibzadeh. M, "A Min-min Max-min Selective Algorithm for Grid Task Scheduling," The Third IEEE/IFIP International Conference on Internet, Uzbekistan, 2007.
  8. F. Dong and S. G. Akl, "Scheduling Algorithms for Grid Computing: State of the art and open problems", Technical Report of the Open Issues in Grid Scheduling Workshop, School of Computing, University Kingston, Ontario, January 2006.
  9. Dantong Yu and Thomas G. Robertazzi "Divisible Load Scheduling for Grid Computing", PDCS'2003, 15th Int'l Conf. Parallel and Distributed Computing and Systems. IASTED, pp. 1 – 9, 2003.
  10. Braun, T. D. , Siegel, H. J. , Beck, N. , Boloni, L. L. , Maheswaran, M. , Reuther, A. I. , Robertson, J. P "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. 2001.
  11. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, "Dynamic mapping of a class of independent tasks onto heterogeneous computing systems, J. Parallel Distribute Computing 59, 2 (Nov 1999), 107 – 121.
  12. R. F. Freund, and M. Gherrity, "Scheduling Resource in Multi-user Heterogeneous Computing Environment with Smartnet", In Proceedings of the 7th IEEE HCW 1998.
  13. Fahd Alharbi, "Simple Scheduling Algorithm with Load Balancing for Grid Computing" Asian Transactions on Computers (ATC ISSN: 2221-4275) Vol 02, Issue 2.
Index Terms

Computer Science
Information Sciences

Keywords

Grid Computing Task Scheduling Load Balancing Heuristics Makespan Resource Utilization

Powered by PhDFocusTM