Policy-Based Task Allocation at Runtime for a Self-Adaptive Edge Computing Infrastructure

Victor Pazmino Betancourt, Maximilian Kirschner, Marius Kreutzer, Jürgen Becker
{"title":"Policy-Based Task Allocation at Runtime for a Self-Adaptive Edge Computing Infrastructure","authors":"Victor Pazmino Betancourt, Maximilian Kirschner, Marius Kreutzer, Jürgen Becker","doi":"10.1109/ISADS56919.2023.10092022","DOIUrl":null,"url":null,"abstract":"Autonomous and distributed Industrial Internet of Things (IIoT) systems are increasingly developed and deployed. They have an enormous demand for resilience and availability. At the same time, they are in a constantly changing system environment. The underlying edge computing infrastructure is characterized by ever increasing processing power and connectivity as well as a high degree of decentralization. To reduce downtime and long redesign loops, self-adaptation capabilities are needed. Automatic reallocation of the executed tasks to the compute nodes is a possible self-adaptation measure. However, the reallocation should be compliant with the different demands, constraints and specifications of the design. At the same time, a major challenge is that the allocation decision should be fast enough to be calculated at runtime. This paper therefore proposes an allocation method that uses demands in the form of policies to compute automatic reallocation at runtime. The integration of the allocation method into runtime is enabled by combining constraint programming, step-wise multi-criteria solution approaches, and resource management at multiple levels. The policy-based allocation method is tested and evaluated in the context of a smart factory site for the function offloading of automated guided vehicles (AGVs) and driverless micromobiles. Our results show that the allocation method is capable of recalculating the allocation during runtime in milliseconds while maintaining design conformity. This enables the system to react to changes in the environment, thereby reducing the downtime of decentralized Industrial Internet of Things systems and increasing availability.","PeriodicalId":412453,"journal":{"name":"2023 IEEE 15th International Symposium on Autonomous Decentralized System (ISADS)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 15th International Symposium on Autonomous Decentralized System (ISADS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS56919.2023.10092022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Autonomous and distributed Industrial Internet of Things (IIoT) systems are increasingly developed and deployed. They have an enormous demand for resilience and availability. At the same time, they are in a constantly changing system environment. The underlying edge computing infrastructure is characterized by ever increasing processing power and connectivity as well as a high degree of decentralization. To reduce downtime and long redesign loops, self-adaptation capabilities are needed. Automatic reallocation of the executed tasks to the compute nodes is a possible self-adaptation measure. However, the reallocation should be compliant with the different demands, constraints and specifications of the design. At the same time, a major challenge is that the allocation decision should be fast enough to be calculated at runtime. This paper therefore proposes an allocation method that uses demands in the form of policies to compute automatic reallocation at runtime. The integration of the allocation method into runtime is enabled by combining constraint programming, step-wise multi-criteria solution approaches, and resource management at multiple levels. The policy-based allocation method is tested and evaluated in the context of a smart factory site for the function offloading of automated guided vehicles (AGVs) and driverless micromobiles. Our results show that the allocation method is capable of recalculating the allocation during runtime in milliseconds while maintaining design conformity. This enables the system to react to changes in the environment, thereby reducing the downtime of decentralized Industrial Internet of Things systems and increasing availability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于策略的自适应边缘计算基础设施运行时任务分配
自主和分布式工业物联网(IIoT)系统得到了越来越多的开发和部署。他们对弹性和可用性有着巨大的需求。同时,他们又处在一个不断变化的制度环境中。底层边缘计算基础设施的特点是不断增强的处理能力和连接性以及高度的去中心化。为了减少停机时间和长时间的重新设计循环,需要自适应功能。将已执行的任务自动重新分配给计算节点是一种可能的自适应措施。但是,重新分配应符合设计的不同需求、约束和规范。同时,一个主要的挑战是分配决策应该足够快,以便在运行时进行计算。因此,本文提出了一种使用策略形式的需求来计算运行时自动再分配的分配方法。通过结合约束编程、分步式多标准解决方案方法和多级资源管理,可以将分配方法集成到运行时中。在智能工厂现场,针对自动导引车(agv)和无人驾驶微型汽车的功能卸载,测试和评估了基于策略的分配方法。结果表明,该分配方法能够在保持设计一致性的情况下,在毫秒级的运行时间内重新计算分配。这使系统能够对环境的变化做出反应,从而减少分散式工业物联网系统的停机时间,提高可用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A pipeline to collaborative AI models creation between Brazilian governmental institutions Policy-Based Task Allocation at Runtime for a Self-Adaptive Edge Computing Infrastructure A Computer Vision Approach to Terminus Movement Analysis of Viedma Glacier An Approach to Workload Generation for Cloud Benchmarking: a View from Alibaba Trace Design of a Soft Gripper Hand for a Quadruped Robot
×
引用
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