Comparative Study of Two GA Based Task Allocation Models in Distributed Computing System
| dc.contributor.author | Vidyarthi D.P.; Tripathi A.K.; Sarker B.K.; Rani K. | |
| dc.date.accessioned | 2025-05-24T09:56:10Z | |
| dc.description.abstract | Genetic Algorithm has emerged as a successful tool for optimization problems. Earlier, we proposed a task allocation model to maximize the reliability of Distributed Computing System(DCS) using genetic algorithm. 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. | |
| dc.identifier.doi | DOI not available | |
| dc.identifier.uri | http://172.23.0.11:4000/handle/123456789/20695 | |
| dc.relation.ispartofseries | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings | |
| dc.title | Comparative Study of Two GA Based Task Allocation Models in Distributed Computing System |