会议专题

Comparative Study of Two GA Based Task Allocation Models in Distributed Computing System

Genetic Algorithm has emerged as a successful tool for optimization problems 1. Earlier, we proposed a task allocation model to maximize the reliability of Distributed Computing System(DCS) using genetic algorithm2. Our objective, in this work, 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 reliablity as obtained in 2. Comparisons of both the algorithms are made by illustrated examples and appropriate comments.

Distributed computing system task allocation reliability turnaround genetic algorithm

Deo Prakash Vidyarthi Anil Kumar Tripathi Biplab Kumer Sarker Kirti Rani

Department of Computer Science, Faculty of Science Banaras Hindu University, Varanasi-221005 INDIA Department of Computer Engineering, Institute of Technology Banaras Hindu University, Varanasi-22100 Department of Computer & Systems Engineering, Kobe University, JAPAN Department of Computer Science, Rani Durgavati University, Jabalpur, INDIA

国际会议

Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

成都

英文

458-462

2003-08-27(万方平台首次上网日期,不代表论文的发表时间)