Maximizing availability for task scheduling in computational grid using genetic algorithm. (30th January 2014)

• Record Type: Journal Article
• Authors: Prakash, Shiv; Vidyarthi, Deo Prakash
• Is Part Of: Concurrency and computation. Volume 27:Number 1(2015:Jan.)
• Page Start: 193
• Page End: 210
• Publication Date: 2014-01-30
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3216
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main"> <title>SUMMARY</title> <p>Computational grid provides a wide distributed platform for high‐end compute intensive applications. Grid scheduling is often carried out to schedule the submitted jobs on the nodes of the grid so that some characteristic parameter is optimized. Availability of the computational nodes is one of the important characteristic parameters and measures the probability of the node availability for job execution. This paper addresses the availability of the grid computational nodes for the job execution and proposes a model to maximize it. As such, the task scheduling problem in grid is nondeterministic polynomial‐time hard, and often, metaheuristics techniques are applied to solve it. Genetic algorithm, a metaheuristic technique based on evolutionary computation, has been used to solve such complex optimization problem. This work proposes a technique for the grid scheduling problem using genetic algorithm with the objective to maximize availability. Simulation experiment, to evaluate the performance of the proposed algorithm, is conducted, and results reveal the effectiveness of the model. A comparative study has also been performed. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>