arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.13514math.OC
收藏

具有网络效应的分布式边缘计算任务分配

Distributed Edge Computing Task Allocation with Network Effects

Northwestern University(西北大学);Argonne National Laboratory(阿贡国家实验室)

Henry Abrahamson, Yongho Kim, Seongha Park, Ermin Wei

AI总结:

本文提出了一种基于双下降法的分布式边缘计算任务分配方法,通过优化QoS在动态变化的网络环境中实现任务分配的高效调度。

摘要:

可部署的边缘计算节点形成网络,用于完成远程传感和监控的科学任务。联网节点集体决定运行哪些科学应用,同时受到各种因素的限制,如异构节点的不同硬件限制和时间变化的服务质量(QoS)要求。我们将任务分配问题建模为一个优化问题,以最大化QoS为目标函数,受约束条件限制。我们使用双下降法解决优化问题,该方法可以以分布式方式实现,受网络通信限制。使用一个利用真实世界数据收集自Sage分布式传感器网络的模拟,我们分析了我们的策略在动态情况下的性能,其中所需的QoS和节点能力发生变化,验证了它能够适应并返回可行解,同时考虑这些变化。

英文摘要:

Field-deployable edge computing nodes form a network and are used to complete scientific tasks for remote sensing and monitoring. The networked nodes collectively decide which scientific applications to run while they are constrained by various factors, such as differing hardware constraints from heterogeneous nodes and time-varying quality of service (QoS) requirements. We model the problem of task allocation as an optimization problem that maximizes the QoS, subject to the constraints. We solve the optimization problem using a dual-descent method, which can be easily implemented in a distributed way subject to the communication constraints of the network. Using a simulation that uses real-world data collected from Sage, a distributed sensor network, we analyze our policy's performance in dynamic situations where the required QoS and the nodes' capabilities change, and verify that it can adapt and return a feasible solution while accounting for those changes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑