arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.09012cs.DC
收藏

私有边缘计算的联合存储分配和计算设计

Joint Storage Allocation and Computation Design for Private Edge Computing

Jiqing Chang, Jin Wang, Kejie Lu, Lingzhi Li, Fei Gu, Jianping Wang

摘要:

近年来,边缘计算(EC)以其高速计算和低延迟特性引起了人们的极大关注。然而,在电子商务的实施过程中存在着许多挑战。首先,由于边缘设备可能不值得信任,因此用户的隐私已经被提出作为主要关注点。在私有边缘计算(PEC)的情况下,用户想要计算其本地矩阵与库中的矩阵之一之间的矩阵乘法,该矩阵冗余地存储在边缘设备中。当利用边缘设备的资源时,隐私性要求每个边缘设备不能知道用户期望哪个存储在其上的矩阵用于乘法。其次,边缘设备通常具有有限的通信和存储资源,这使得它们不可能将所有矩阵存储在库中。在本文中,我们考虑到有限的边缘设备的资源,并提出了一个统一的框架PEC。在该框架内,我们研究了两个高度耦合的问题,(1)存储分配,它决定了哪些矩阵存储在每个边缘设备上,(2)计算设计,它决定了每个边缘设备中的哪些矩阵(或它们的线性组合)被选择参与计算过程并考虑隐私。具体地说,我们给出了一个通用的存储分配方案,然后设计了两个可行的私有计算方案,一般私有计算(GPC)方案和私有编码计算(PCC)方案。特别地,GPC可以应用于一般情况,PCC只能应用于特殊情况,而PCC实现了较小的通信负载。我们从理论上分析了所提出的计算方案,并与其他方案进行了比较。最后,我们进行了大量的模拟,以显示所提出的计划的有效性。

英文摘要:

In recent years, edge computing (EC) has attracted great attention for its high-speed computing and low-latency characteristics. However, there are many challenges in the implementation of EC. Firstly, user's privacy has been raised as a major concern because the edge devices may be untrustworthy. In the case of Private Edge Computing (PEC), a user wants to compute a matrix multiplication between its local matrix and one of the matrices in a library, which has been redundantly stored in edge devices. When utilizing resources of edge devices, the privacy requires that each edge device cannot know which matrix stored on it is desired by the user for the multiplication. Secondly, edge devices usually have limited communication and storage resources, which makes it impossible for them to store all matrices in the library. In this paper, we consider the limited resources of edge devices and propose an unified framework for PEC. Within the framework, we study two highly-coupled problems, (1) storage allocation, that determines which matrices are stored on each edge device, and (2) computation design, that determines which matrices (or linear combinations of them) in each edge device are selected to participate in the computing process with the privacy consideration. Specifically, we give a general storage allocation scheme and then design two feasible private computation schemes, i.e., General Private Computation (GPC) scheme and Private Coded Computation (PCC) scheme. In particular, GPC can be applied in general case and PCC can only be applied in special cases, while PCC achieves less communication load. We theoretically analyze the proposed computing schemes and compare them with other schemes. Finally, we conduct extensive simulations to show the effectiveness of the proposed schemes.

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

↑