Adam Włodarczyk, I. Pozniak-Koszalka, L. Koszalka, A. Kasprzak, D. Zydek
{"title":"Task Allocation in Torus Mesh Networks Using Differential Evolution","authors":"Adam Włodarczyk, I. Pozniak-Koszalka, L. Koszalka, A. Kasprzak, D. Zydek","doi":"10.1109/ICSEng.2017.54","DOIUrl":null,"url":null,"abstract":"In the paper, the problem of efficient task allocation in torus mesh network is considered. The authors tested the implemented metaheuristic algorithm which is based on Differential Evaluation method. The focus is taken on tuning the algorithm, i.e., choosing the best parameters of mutation scheme. The research was made using the new designed and implemented experimentation system. Ten mutation schemes were taken into consideration. These schemes and a random algorithm as the reference were compared. The results of experiments showed that using one of mutation schemes called DE/rand/1 can ensure the greatest profit.","PeriodicalId":202005,"journal":{"name":"2017 25th International Conference on Systems Engineering (ICSEng)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 25th International Conference on Systems Engineering (ICSEng)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSEng.2017.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In the paper, the problem of efficient task allocation in torus mesh network is considered. The authors tested the implemented metaheuristic algorithm which is based on Differential Evaluation method. The focus is taken on tuning the algorithm, i.e., choosing the best parameters of mutation scheme. The research was made using the new designed and implemented experimentation system. Ten mutation schemes were taken into consideration. These schemes and a random algorithm as the reference were compared. The results of experiments showed that using one of mutation schemes called DE/rand/1 can ensure the greatest profit.