{"title":"基于能耗约束的多云系统高效计算卸载","authors":"Xiao Ge, Q. Zhang","doi":"10.1109/ICACTE55855.2022.9943608","DOIUrl":null,"url":null,"abstract":"With the increasing functionalities of mobile terminals, computation offloading has become a good way to alleviate the limitation of terminal computing resource and improve terminal performance. In this paper, we propose an efficient computation offloading strategy for multi-cloud system to minimize makespan with terminal energy consumption constraint. The proposed strategy first sorts tasks and establishes paths. Then tasks on each established path are counted as an integrated task and assigned to a worker node with less completion time iteratively. After the initial task assignment, performance optimization is performed to satisfy energy consumption constraint and further decrease makespan. Experimental results show that the proposed approach has better performance compared to genetic algorithm and greedy algorithm.","PeriodicalId":165068,"journal":{"name":"2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient Computation Offloading with Energy Consumption Constraint for Multi-Cloud System\",\"authors\":\"Xiao Ge, Q. Zhang\",\"doi\":\"10.1109/ICACTE55855.2022.9943608\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increasing functionalities of mobile terminals, computation offloading has become a good way to alleviate the limitation of terminal computing resource and improve terminal performance. In this paper, we propose an efficient computation offloading strategy for multi-cloud system to minimize makespan with terminal energy consumption constraint. The proposed strategy first sorts tasks and establishes paths. Then tasks on each established path are counted as an integrated task and assigned to a worker node with less completion time iteratively. After the initial task assignment, performance optimization is performed to satisfy energy consumption constraint and further decrease makespan. Experimental results show that the proposed approach has better performance compared to genetic algorithm and greedy algorithm.\",\"PeriodicalId\":165068,\"journal\":{\"name\":\"2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACTE55855.2022.9943608\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE55855.2022.9943608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient Computation Offloading with Energy Consumption Constraint for Multi-Cloud System
With the increasing functionalities of mobile terminals, computation offloading has become a good way to alleviate the limitation of terminal computing resource and improve terminal performance. In this paper, we propose an efficient computation offloading strategy for multi-cloud system to minimize makespan with terminal energy consumption constraint. The proposed strategy first sorts tasks and establishes paths. Then tasks on each established path are counted as an integrated task and assigned to a worker node with less completion time iteratively. After the initial task assignment, performance optimization is performed to satisfy energy consumption constraint and further decrease makespan. Experimental results show that the proposed approach has better performance compared to genetic algorithm and greedy algorithm.