Welcome to the InfoSci Platform
Reference Hub11
GA Based Scheduling Model for Computational Grid to Minimize Turnaround Time

GA Based Scheduling Model for Computational Grid to Minimize Turnaround Time

Zahid Raza, Deo P. Vidyarthi
Copyright: © 2009 |Volume: 1 |Issue: 4 |Pages: 21
ISSN: 1938-0259|EISSN: 1938-0267|ISSN: 1938-0259|EISBN13: 9781616920937|EISSN: 1938-0267|DOI: 10.4018/jghpc.2009070806
Cite Article Cite Article

MLA

Raza, Zahid, and Deo P. Vidyarthi. "GA Based Scheduling Model for Computational Grid to Minimize Turnaround Time." IJGHPC vol.1, no.4 2009: pp.70-90. http://doi.org/10.4018/jghpc.2009070806

APA

Raza, Z. & Vidyarthi, D. P. (2009). GA Based Scheduling Model for Computational Grid to Minimize Turnaround Time. International Journal of Grid and High Performance Computing (IJGHPC), 1(4), 70-90. http://doi.org/10.4018/jghpc.2009070806

Chicago

Raza, Zahid, and Deo P. Vidyarthi. "GA Based Scheduling Model for Computational Grid to Minimize Turnaround Time," International Journal of Grid and High Performance Computing (IJGHPC) 1, no.4: 70-90. http://doi.org/10.4018/jghpc.2009070806

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Scheduling on distributed systems is an NP hard problem and grid being a wide heterogeneous expandable system makes scheduling even a tougher job. Genetic algorithm, based on natural selection and evolution has gained popularity in recent times because of its effectiveness in handling optimization problems. In this article, a job-scheduling model for a computational grid with the objective of minimizing the turnaround time using genetic algorithm is proposed. The model evaluates various clusters in the grid to find the most suitable one with minimum turnaround time for the job-scheduling. Simulation studies compare the performance of this model with other similar models.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.