可中止测试集的几乎紧RMR下界
An Almost Tight RMR Lower Bound for Abortable Test-And-Set
摘要：
我们证明了Ω（log n/loglog n）的下限的远程内存引用（RMR）的复杂性可中止的测试和设置（领导选举）的缓存一致性（CC）和分布式共享内存（DSM）模型。这将可中止和不可中止的测试和设置的复杂性分开，因为后者具有恒定的RMR复杂性（Golab，Hendler，Woelfel，SIAM Journal of Computing Vol.39，2010）。Golab、Hendler、Hadzilacos和Woelfel（分布式计算第25卷，2012年）表明，可以从具有恒定RMR复杂度的寄存器和TAS对象实现比较和交换。我们观察到，只要所使用的TAS对象是可中止的，对该实现的小修改是可中止的。
英文摘要：
We prove a lower bound of Omega(log n/loglog n) for the remote memory reference (RMR) complexity of abortable test-and-set (leader election) in the cache-coherent (CC) and the distributed shared memory (DSM) model. This separates the complexities of abortable and non-abortable test-and-set, as the latter has constant RMR complexity (Golab, Hendler, Woelfel, SIAM Journal of Computing Vol. 39, 2010). Golab, Hendler, Hadzilacos and Woelfel (Distributed Computing Vol. 25, 2012) showed that compare-and-swap can be implemented from registers and TAS objects with constant RMR complexity. We observe that a small modification to that implementation is abortable, provided that the used TAS objects are abortable.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
