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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Grid Scheduling Algorithms: A Comparative Analysis

by Seema Rani, Ritika
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 104 - Number 12
Year of Publication: 2014
Authors: Seema Rani, Ritika
10.5120/18255-9351

Seema Rani, Ritika . Grid Scheduling Algorithms: A Comparative Analysis. International Journal of Computer Applications. 104, 12 ( October 2014), 26-29. DOI=10.5120/18255-9351

@article{ 10.5120/18255-9351,
author = { Seema Rani, Ritika },
title = { Grid Scheduling Algorithms: A Comparative Analysis },
journal = { International Journal of Computer Applications },
issue_date = { October 2014 },
volume = { 104 },
number = { 12 },
month = { October },
year = { 2014 },
issn = { 0975-8887 },
pages = { 26-29 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume104/number12/18255-9351/ },
doi = { 10.5120/18255-9351 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:36:27.385554+05:30
%A Seema Rani
%A Ritika
%T Grid Scheduling Algorithms: A Comparative Analysis
%J International Journal of Computer Applications
%@ 0975-8887
%V 104
%N 12
%P 26-29
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Grid computing is one of the distributed computing where the resources of various computers are shared to solve a particular problem. Grid can be used for variety of purposes. Job scheduling is used to schedule the applications submitted by the user to appropriate resources in grid environment. It allows best match of resource for a particular job. In this paper various job scheduling algorithms are compared. The job scheduling algorithms are compared and contrasted.

References
  1. I. Foster, C. Kesselman, and S. Tuecke. The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of High Performance Computing Application,15(3):200,2001
  2. R. Buyya and M. Murshed, "Gridsim: a toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. " Concurrency and Computation : Practice and Experience, vol. 14, pp 1175-1220,2002
  3. E. Huedo, R. S. Montero, and I. M. Liorente. The GridWay framework for adaptive scheduling and execution on grids scalable computing :practice and experience,6(3):1-8,2005
  4. S. Gokuldev,Lija Anna Mathew Task Graph Based Scheduling And Resource Monitoring In Grid Computing vol. 2 Issue 5,May-2013
  5. M. Chtepen, "Dynamic scheduling in grids system," Sixth Firw PhD Symposium, Faculty of Engineering, Ghent University, 2005
  6. Javier carretero, Fatos Xhafa Genetic algorithm based schedulers for grid computing ICIC international volume 3,number 6
  7. Ku Ruhana Ku-Mahamud Husna Jamal Abdul Nasir , "Ant Colony Algorithm for Job Scheduling in grid Computing", in 2010 Fourth Asia International Conference on Mathematical/Analytical Modeling and Computer Simulation,IEEE computer Society 2010
  8. Y. Huang, A. Brocco, N. Bessis P. Kuonen, B. Hirsbrunner,"Exploring Decentralized Dynamic Scheduling For Grids and Clouds using the Community-aware Scheduling algorithm",in:2011 Future Generation Computing Systems Elsevier
  9. Kennedy J and R ,C Eberhart (1995) 'particle swarm OPTIMIZATION' proc IEEE int 'l Conf neural Network.
Index Terms

Computer Science
Information Sciences

Keywords

Makespan Throughput SETI Crossover Mutation Minimum Completion Time

Powered by PhDFocusTM