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

共享内存仿真存储成本的信息论下限

Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation

Viveck R. Cadambe, Zhiying Wang, Nancy Lynch

摘要:

本文的重点是了解在异步分布式消息传递系统上模拟原子共享内存的存储开销。以前的文献已经开发了几种基于复制和擦除编码技术的共享存储器仿真算法。在本文中,我们提出了信息理论的共享内存仿真算法所产生的存储成本的下限。我们的存储成本下限是普遍适用的,也就是说,我们不假设的算法的结构或编码的数据的方法。我们考虑一个任意的算法$A$,实现一个原子的多作者单读者(MWSR)共享内存变量,其值来自一个有限的集合$\mathcal{V}$在一个系统的$N$服务器连接的点对点异步链路。我们要求在每次公平执行算法$A$时,服务器故障的数量小于参数$f$,在非故障客户端调用的每个操作都终止。在算法$A$中,服务器的存储开销定义为服务器可以采用的状态数的对数(以2为底);算法$A$的总存储开销是所有服务器的存储开销之和。我们的结果如下。(i)我们表明,如果算法$A$不使用服务器的八卦,那么总的存储成本是由$2 \frac{N}{N-f+1}\log_2|\mathcal{V}|-o(\log_2|\mathcal{V}|)$下界。(ii)总存储成本至少为$2 \frac{N}{N-f+2} \log_{2}|\mathcal{V}|-o(\log_{2}|\mathcal{V}|)$,即使算法使用服务器流言。(iii)我们考虑的算法中的写入协议发送的值在最多一个阶段的信息。我们表明,总的存储成本是至少$ν^* \frac{N}{N-f+ν^*-1} \log_2( |\mathcal{V}|)- o(\log_2(|\mathcal{V}|),$,其中$ν^*$是最小的$f+1$和执行的活动写操作的数量。

英文摘要:

The focus of this paper is to understand storage costs of emulating an atomic shared memory over an asynchronous, distributed message passing system. Previous literature has developed several shared memory emulation algorithms based on replication and erasure coding techniques. In this paper, we present information-theoretic lower bounds on the storage costs incurred by shared memory emulation algorithms. Our storage cost lower bounds are universally applicable, that is, we make no assumption on the structure of the algorithm or the method of encoding the data. We consider an arbitrary algorithm $A$ that implements an atomic multi-writer single-reader (MWSR) shared memory variable whose values come from a finite set $\mathcal{V}$ over a system of $N$ servers connected by point-to-point asynchronous links. We require that in every fair execution of algorithm $A$ where the number of server failures is smaller than a parameter $f$, every operation invoked at a non-failing client terminates. We define the storage cost of a server in algorithm $A$ as the logarithm (to base 2) of number of states it can take on; the total-storage cost of algorithm $A$ is the sum of the storage cost of all servers. Our results are as follows. (i) We show that if algorithm $A$ does not use server gossip, then the total storage cost is lower bounded by $2 \frac{N}{N-f+1}\log_2|\mathcal{V}|-o(\log_2|\mathcal{V}|)$. (ii) The total storage cost is at least $2 \frac{N}{N-f+2} \log_{2}|\mathcal{V}|-o(\log_{2}|\mathcal{V}|)$ even if the algorithm uses server gossip. (iii) We consider algorithms where the write protocol sends information about the value in at most one phase. We show that the total storage cost is at least $ν^* \frac{N}{N-f+ν^*-1} \log_2( |\mathcal{V}|)- o(\log_2(|\mathcal{V}|),$ where $ν^*$ is the minimum of $f+1$ and the number of active write operations of an execution.

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

↑