Sunyanan Choochotkaew, H. Yamaguchi, T. Higashino, Dominik Schäfer, Janick Edinger, C. Becker
{"title":"普适计算中连续任务卸载的自适应资源分配","authors":"Sunyanan Choochotkaew, H. Yamaguchi, T. Higashino, Dominik Schäfer, Janick Edinger, C. Becker","doi":"10.1109/PERCOMW.2018.8480400","DOIUrl":null,"url":null,"abstract":"Task offloading has proven its potential in pervasive environments in numerous systems. In particular, code offloading has gained popularity as it allows to spontaneously forward work packages to remote resources. While for discrete tasks there are multiple systems that allow for code offloading already, stream processing has gained less research attention. In this paper, we propose a self-adaptive resource allocation approach for continuous task offloading. First, we tackle the issue of communication overhead by predicting future workload. We minimize not only the number of resource requests but also the scheduling delay. Second, we introduce a learning-based resource allocation mechanism that matches jobs and resource providers. The goal of the allocation mechanism is to assign jobs only to those resources that can finish a job in time. We use a code profiler to analyze the complexity of algorithms and perform machine learning to assign jobs to resources. Our results show that we can reduce the total communication overhead by more than 90 percent and assign jobs successfully with an F-Measure of .863.","PeriodicalId":190096,"journal":{"name":"2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Self-adaptive Resource Allocation for Continuous Task Offloading in Pervasive Computing\",\"authors\":\"Sunyanan Choochotkaew, H. Yamaguchi, T. Higashino, Dominik Schäfer, Janick Edinger, C. Becker\",\"doi\":\"10.1109/PERCOMW.2018.8480400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Task offloading has proven its potential in pervasive environments in numerous systems. In particular, code offloading has gained popularity as it allows to spontaneously forward work packages to remote resources. While for discrete tasks there are multiple systems that allow for code offloading already, stream processing has gained less research attention. In this paper, we propose a self-adaptive resource allocation approach for continuous task offloading. First, we tackle the issue of communication overhead by predicting future workload. We minimize not only the number of resource requests but also the scheduling delay. Second, we introduce a learning-based resource allocation mechanism that matches jobs and resource providers. The goal of the allocation mechanism is to assign jobs only to those resources that can finish a job in time. We use a code profiler to analyze the complexity of algorithms and perform machine learning to assign jobs to resources. Our results show that we can reduce the total communication overhead by more than 90 percent and assign jobs successfully with an F-Measure of .863.\",\"PeriodicalId\":190096,\"journal\":{\"name\":\"2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PERCOMW.2018.8480400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2018.8480400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Self-adaptive Resource Allocation for Continuous Task Offloading in Pervasive Computing
Task offloading has proven its potential in pervasive environments in numerous systems. In particular, code offloading has gained popularity as it allows to spontaneously forward work packages to remote resources. While for discrete tasks there are multiple systems that allow for code offloading already, stream processing has gained less research attention. In this paper, we propose a self-adaptive resource allocation approach for continuous task offloading. First, we tackle the issue of communication overhead by predicting future workload. We minimize not only the number of resource requests but also the scheduling delay. Second, we introduce a learning-based resource allocation mechanism that matches jobs and resource providers. The goal of the allocation mechanism is to assign jobs only to those resources that can finish a job in time. We use a code profiler to analyze the complexity of algorithms and perform machine learning to assign jobs to resources. Our results show that we can reduce the total communication overhead by more than 90 percent and assign jobs successfully with an F-Measure of .863.