By Topic

Comparative study of two GA based task allocation models in distributed computing system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Deo Prakash Vidyarthi ; Dept. of Comput. Sci., Banaras Hindu Univ., Varanasi, India ; Anil Kumar Tripathi ; Biplab Kumer Sarker ; Kirti Rani

Genetic algorithm has emerged as a successful tool for optimization problems. Previously, we proposed a task allocation model to maximize the reliability of a distributed computing system (DCS) using a genetic algorithm. Our objective is to use the same simple genetic algorithm to minimize the turnaround time of the task given to the DCS for execution and then to compare the resultant allocation with the allocation of maximal reliability as obtained by Vidyarthi et al. (2001). Comparisons of both the algorithms are made by illustrated examples and appropriate comments.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Date of Conference:

27-29 Aug. 2003