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

D. P. Vidyarthi, A. Tripathi, B. K. Sarker, Kirti Rani
{"title":"Comparative study of two GA based task allocation models in distributed computing system","authors":"D. P. Vidyarthi, A. Tripathi, B. K. Sarker, Kirti Rani","doi":"10.1109/PDCAT.2003.1236344","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2003.1236344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

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.
分布式计算系统中基于遗传算法的两种任务分配模型的比较研究
遗传算法已成为解决优化问题的一种成功工具。在此之前,我们提出了一种使用遗传算法来最大化分布式计算系统(DCS)可靠性的任务分配模型。我们的目标是使用相同的简单遗传算法来最小化分配给DCS执行的任务的周转时间,然后将结果分配与Vidyarthi等人(2001)获得的最大可靠性分配进行比较。通过实例和适当的注释对两种算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信