Multi-step Prediction of Worker Resource Usage at the Extreme Edge

Ruslan Kain, Sara A. Elsayed, Y. Chen, H. Hassanein
{"title":"Multi-step Prediction of Worker Resource Usage at the Extreme Edge","authors":"Ruslan Kain, Sara A. Elsayed, Y. Chen, H. Hassanein","doi":"10.1145/3551659.3559051","DOIUrl":null,"url":null,"abstract":"Democratizing the edge by leveraging the prolific yet underutilized computational resources of end devices, referred to as Extreme Edge Devices (EEDs), can open a new edge computing tech market that is people-owned, democratically managed, and accessible/lucrative to all. Parallel computing at EEDs can also move the computing service much closer to end-users, which can help satisfy the stringent Quality-of-Service (QoS) requirements of delay-critical and/or data-intensive IoT applications. However, EEDs are heterogeneous user-owned devices, and are thus subject to a highly dynamic user access behavior (i.e., dynamic resource usage). This makes the process of determining the computational capability of EEDs increasingly challenging. Estimating the dynamic resource usage of EEDs (i.e., workers) has been mostly overlooked. The complexity of Machine Learning (ML)-based models renders them impractical for deployment at the edge for the purpose of such estimations. In this paper, we propose the Resource Usage Multi-step Prediction (RUMP) scheme to estimate the dynamic resource usage of workers over multiple steps ahead in a computationally efficient way while providing a relatively high prediction accuracy. Towards that end, RUMP exploits the use of the Hierarchical Dirichlet Process-Hidden Semi-Markov Model (HDP-HSMM) to estimate the dynamic resource usage of workers in EED-based computing paradigms. Extensive evaluations on a real testbed of heterogeneous workers for multi-step sizes show an 87.5% prediction accuracy for the starting point of 2-steps and coming to as little as a 16% average difference in prediction error compared to a representative of state-of-the-art ML-based schemes.","PeriodicalId":423926,"journal":{"name":"Proceedings of the 25th International ACM Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 25th International ACM Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3551659.3559051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Democratizing the edge by leveraging the prolific yet underutilized computational resources of end devices, referred to as Extreme Edge Devices (EEDs), can open a new edge computing tech market that is people-owned, democratically managed, and accessible/lucrative to all. Parallel computing at EEDs can also move the computing service much closer to end-users, which can help satisfy the stringent Quality-of-Service (QoS) requirements of delay-critical and/or data-intensive IoT applications. However, EEDs are heterogeneous user-owned devices, and are thus subject to a highly dynamic user access behavior (i.e., dynamic resource usage). This makes the process of determining the computational capability of EEDs increasingly challenging. Estimating the dynamic resource usage of EEDs (i.e., workers) has been mostly overlooked. The complexity of Machine Learning (ML)-based models renders them impractical for deployment at the edge for the purpose of such estimations. In this paper, we propose the Resource Usage Multi-step Prediction (RUMP) scheme to estimate the dynamic resource usage of workers over multiple steps ahead in a computationally efficient way while providing a relatively high prediction accuracy. Towards that end, RUMP exploits the use of the Hierarchical Dirichlet Process-Hidden Semi-Markov Model (HDP-HSMM) to estimate the dynamic resource usage of workers in EED-based computing paradigms. Extensive evaluations on a real testbed of heterogeneous workers for multi-step sizes show an 87.5% prediction accuracy for the starting point of 2-steps and coming to as little as a 16% average difference in prediction error compared to a representative of state-of-the-art ML-based schemes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
极端边缘下工作资源使用的多步预测
通过利用终端设备的高产但未充分利用的计算资源(称为极限边缘设备(eed))来实现边缘计算的民主化,可以打开一个新的边缘计算技术市场,这个市场是由人们拥有的,民主管理的,并且对所有人都可以访问/有利可图。eed的并行计算还可以使计算服务更接近最终用户,这有助于满足延迟关键和/或数据密集型物联网应用的严格服务质量(QoS)要求。但是,eed是异构的用户拥有的设备,因此受到高度动态的用户访问行为(即动态资源使用)的影响。这使得确定eed计算能力的过程越来越具有挑战性。估计eed(即工作人员)的动态资源使用情况大多被忽视了。基于机器学习(ML)的模型的复杂性使得它们无法在边缘部署以进行此类估计。在本文中,我们提出了资源使用多步预测(Resource Usage Multi-step Prediction, RUMP)方案,以一种计算效率高的方式提前估计工人的动态资源使用情况,同时提供了相对较高的预测精度。为此,RUMP利用分层狄利克雷过程-隐半马尔可夫模型(HDP-HSMM)来估计基于ed的计算范式中工人的动态资源使用情况。在多步大小的异构工人的真实测试平台上进行的广泛评估显示,与最先进的基于ml的方案代表相比,2步起点的预测精度为87.5%,预测误差平均差异仅为16%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Interference Aware Heuristics to Optimize Power Beacons for Battery-less WSNs The Interplay Between Intelligent Networks and Enabling Technologies for Future Wireless Networks A Novel Mixed Method of Machine Learning Based Models in Vehicular Traffic Flow Prediction Characterizing Wi-Fi Probing Behavior for Privacy-Preserving Crowdsensing Anonymized Counting of Nonstationary Wi-Fi Devices When Monitoring Crowds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1