Self-adaptive Resource Allocation for Continuous Task Offloading in Pervasive Computing

Sunyanan Choochotkaew, H. Yamaguchi, T. Higashino, Dominik Schäfer, Janick Edinger, C. Becker
{"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}
引用次数: 6

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.
普适计算中连续任务卸载的自适应资源分配
任务卸载已经在许多系统的普遍环境中证明了它的潜力。特别是,代码卸载变得越来越流行,因为它允许自发地将工作包转发到远程资源。虽然对于离散任务,已经有多个系统允许代码卸载,但流处理得到的研究关注较少。本文提出了一种用于连续任务卸载的自适应资源分配方法。首先,我们通过预测未来的工作负载来解决通信开销问题。我们不仅最小化了资源请求的数量,而且最小化了调度延迟。其次,我们引入了一种基于学习的资源分配机制,将工作和资源提供者相匹配。分配机制的目标是只将作业分配给那些能够及时完成作业的资源。我们使用代码分析器来分析算法的复杂性,并执行机器学习来为资源分配任务。我们的结果表明,我们可以减少90%以上的总通信开销,并以0.863的F-Measure成功地分配工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信