arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.10011cs.ITmath.IT
收藏

动态加载CPU的Helper计算卸载的随机控制

Stochastic Control of Computation Offloading to a Helper with a Dynamically Loaded CPU

Yunzheng Tao, Changsheng You, Ping Zhang, Kaibin Huang

摘要:

由于无线网络的密集化,在边缘设备处存在大量空闲计算资源。这些资源可以通过从附近的小型物联网设备卸载繁重的计算任务来清除,从而克服它们的局限性并延长它们的电池寿命。然而,与专用服务器不同,边缘助手提供的备用资源是随机和间歇性的。因此,用户必须智能地控制用于卸载和本地计算的数据量,以确保计算任务能够以耗时最少的能量完成。在本文中,我们设计的能量有效的控制策略,在一个计算卸载系统与一个随机的通道和一个助手与一个动态加载的CPU。具体而言,所采用的政策的帮助者的目的是在确定的大小卸载和本地计算的数据在不同的时隙中的一个给定的任务,使传输和本地CPU的总能耗最小化下的任务期限的约束。因此,除了平衡卸载和本地计算之外,该策略还赋予卸载用户对信道和助手随机性的鲁棒性。通过将信道和辅助CPU建模为马尔可夫链,将卸载控制问题转化为马尔可夫决策过程。虽然动态规划(DP)的数值求解问题并不产生封闭形式的最优策略,我们利用的过程来量化的最优策略结构和应用的结果来设计最优或次优的政策。对于从零到大缓冲区的不同情况,策略的低复杂性克服了DP中由通道、辅助CPU和缓冲区状态的联合考虑引起的“维数灾难”。

英文摘要:

Due to densification of wireless networks, there exist abundance of idling computation resources at edge devices. These resources can be scavenged by offloading heavy computation tasks from small IoT devices in proximity, thereby overcoming their limitations and lengthening their battery lives. However, unlike dedicated servers, the spare resources offered by edge helpers are random and intermittent. Thus, it is essential for a user to intelligently control the amounts of data for offloading and local computing so as to ensure a computation task can be finished in time consuming minimum energy. In this paper, we design energy-efficient control policies in a computation offloading system with a random channel and a helper with a dynamically loaded CPU. Specifically, the policy adopted by the helper aims at determining the sizes of offloaded and locally-computed data for a given task in different slots such that the total energy consumption for transmission and local CPU is minimized under a task-deadline constraint. As the result, the polices endow an offloading user robustness against channel-and-helper randomness besides balancing offloading and local computing. By modeling the channel and helper-CPU as Markov chains, the problem of offloading control is converted into a Markov-decision process. Though dynamic programming (DP) for numerically solving the problem does not yield the optimal policies in closed form, we leverage the procedure to quantify the optimal policy structure and apply the result to design optimal or sub-optimal policies. For different cases ranging from zero to large buffers, the low-complexity of the policies overcomes the "curse-of-dimensionality" in DP arising from joint consideration of channel, helper CPU and buffer states.

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

↑