单写入器存储器实现中的进度-空间权衡
Progress-Space Tradeoffs in Single-Writer Memory Implementations
摘要:
为共享内存分布式系统设计的大多数算法都假定为单写入器多读取器(SWMR)设置,其中每个进程都提供了一个唯一的所有进程都可读的寄存器。在一个系统中,计算是由来自一个非常大的(可能是无界的)潜在参与者的集合的有限数量的进程来执行的,SWMR内存的假设不再是合理的。如果只提供有限数量的多写多读(MWMR)寄存器,我们不能依赖于一个先验的进程分配寄存器。在该设置中,模拟SWMR存储器,或等同地,确保稳定写入(即,每个写入的值都保持在存储器中)。在本文中,我们提出了一个SWMR模拟,适应所需的进展条件的MWMR寄存器的数量。对于任何给定的k从1到n,我们提出了一种算法,只使用n+k-1寄存器来模拟一个k锁自由SWMR存储器。我们还给出了2-锁自由情况下所需的n+1个寄存器的匹配下界,这支持了我们的假设,该算法是空间最优的。我们的下界对于2-障碍自由的严格较弱的进展条件成立,这表明k-障碍自由和k-锁自由SWMR模拟的空间复杂度可能一致。
英文摘要:
Most algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register readable by all. In a system where computation is performed by a bounded number n of processes coming from a very large (possibly unbounded) set of potential participants, the assumption of a SWMR memory is no longer reasonable. If only a bounded number of multi-writer multi-reader (MWMR) registers are provided, we cannot rely on an a priori assignment of processes to registers. In this setting, simulating SWMR memory, or equivalently, ensuring stable writing (i.e., every written value persists in the memory), is desirable. In this paper, we propose a SWMR simulation that adapts the number of MWMR registers used to the desired progress condition. For any given k from 1 to n, we present an algorithm that uses only n+k-1 registers to simulate a k-lock-free SWMR memory. We also give a matching lower bound of n+1 registers required for the case of 2-lock-freedom, which supports our conjectures that the algorithm is space-optimal. Our lower bound holds for the strictly weaker progress condition of 2-obstruction-freedom, which suggests that the space complexity for k-obstruction-free and k-lock-free SWMR simulations might coincide.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。