D. P. Vidyarthi, A. Tripathi, B. K. Sarker, Kirti Rani
{"title":"分布式计算系统中基于遗传算法的两种任务分配模型的比较研究","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":"{\"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}","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}
Comparative study of two GA based task allocation models in distributed computing system
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.