arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.00486cs.DCcs.ITmath.IT
收藏

边缘计算系统中快速服务(速率)的冗余管理

Redundancy Management for Fast Service (Rates) in Edge Computing Systems

Pei Peng, Emina Soljanin

AI总结:

本文研究边缘计算中冗余资源分配问题,以平均系统计算时间和阻塞概率为指标,提出两种优化算法,并通过仿真证明其在不同服务时间分布下显著优于基准方法。

摘要:

边缘计算运行在云端与终端用户之间,致力于为并发用户提供低延迟的计算服务。由于边缘系统通常运行在不确定环境中,冗余使用多个边缘节点可以降低延迟。然而,边缘系统的计算和存储资源有限,将更多资源分配给某些计算任务,要么会阻塞其他任务的执行,要么会将其执行传递到云端,从而增加延迟。本文使用平均系统计算时间和阻塞概率来评估边缘系统性能,并据此分析最优资源分配。我们还提出了阻塞概率和平均系统时间优化算法。仿真结果表明,对于不同的服务时间分布,两种算法均显著优于基准算法,并展示了最优复制因子如何随系统各参数的变化而变化。

英文摘要:

Edge computing operates between the cloud and end users and strives to provide low-latency computing services for simultaneous users. Redundant use of multiple edge nodes can reduce latency, as edge systems often operate in uncertain environments. However, since edge systems have limited computing and storage resources, directing more resources to some computing jobs will either block the execution of others or pass their execution to the cloud, thus increasing latency. This paper uses the average system computing time and blocking probability to evaluate edge system performance and analyzes the optimal resource allocation accordingly. We also propose blocking probability and average system time optimization algorithms. Simulation results show that both algorithms significantly outperform the benchmark for different service time distributions and show how the optimal replication factor changes with varying parameters of the system.

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

↑