可恢复互斥的RMR复杂度的紧下界
Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion
摘要:
我们提出了一个严格的RMR复杂性下界的可恢复互斥(RME)问题,定义Golab和Ramaraju \cite{GR2019a}。特别是,我们证明了仅使用原子读、写、获取和存储、获取和增量以及比较和交换操作的任何$n$进程RME算法在CC和DSM模型上的RMR复杂度为$Ω(\log n/\log\log n)$。该下限覆盖了已经在RME算法中使用的所有实际同步原语,并且与采用交换对象的算法的最佳上限(例如,[5,6,10])。具有更好的RMR复杂度的算法仅通过以下方式获得:(i)假设所有故障都是系统范围的[7],(ii)采用大小为$(\log n)^{ω(1)}$的取加对象[12],或(iii)使用实际系统中不可用的人工定义的同步原语[6,9]。
英文摘要:
We present a tight RMR complexity lower bound for the recoverable mutual exclusion (RME) problem, defined by Golab and Ramaraju \cite{GR2019a}. In particular, we show that any $n$-process RME algorithm using only atomic read, write, fetch-and-store, fetch-and-increment, and compare-and-swap operations, has an RMR complexity of $Ω(\log n/\log\log n)$ on the CC and DSM model. This lower bound covers all realistic synchronization primitives that have been used in RME algorithms and matches the best upper bounds of algorithms employing swap objects (e.g., [5,6,10]). Algorithms with better RMR complexity than that have only been obtained by either (i) assuming that all failures are system-wide [7], (ii) employing fetch-and-add objects of size $(\log n)^{ω(1)}$ [12], or (iii) using artificially defined synchronization primitives that are not available in actual systems [6,9].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。