arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1208.1723cs.DCcs.DS
收藏

RMR有效的随机可中止互斥

RMR-Efficient Randomized Abortable Mutual Exclusion

Abhijeet Pareek, Philipp Woelfel

摘要:

最近的研究互斥共享内存系统集中在“本地自旋”算法。性能是使用“远程内存引用”(RMR)度量来衡量的。在最近的文献中,我们考虑一个标准的异步共享内存模型与N个进程,它允许原子读,写和比较和交换(简称:CAS)操作。在这样的模型中,对于最优确定性算法,每次通过临界区的RMR数量的渐近紧上限和下限是Theta(log N)(参见Yang和Anderson,1995,以及Attiya,Hendler和Woelfel,2008)。最近,已经设计了几种随机算法,其打破了Omega(log N)屏障,并且预期每次传代仅需要o(log N)RMR(参见Hendler和Woelfel,2010,Hendler和Woelfel,2011,以及Bender和Gilbert,2011)。在本文中,我们提出了第一个随机的“可中止”互斥算法,实现了一个子对数预期的RMR复杂度。更准确地说,对于一个弱对手(它可以根据整个过去的历史,但不是每个进程的最新硬币翻转来做出调度决策),每个进程都需要一个预期的O(log N/ log log N)RMR来进入和退出临界区。如果一个进程收到一个中止信号,它可以在有限的步骤内中止进入临界区的尝试,并导致O(log N/ log log N)的RMR。

英文摘要:

Recent research on mutual exclusion for shared-memory systems has focused on "local spin" algorithms. Performance is measured using the "remote memory references" (RMRs) metric. As common in recent literature, we consider a standard asynchronous shared memory model with N processes, which allows atomic read, write and compare-and-swap (short: CAS) operations. In such a model, the asymptotically tight upper and lower bound on the number of RMRs per passage through the Critical Section is Theta(log N) for the optimal deterministic algorithms (see Yang and Anderson,1995, and Attiya, Hendler and Woelfel, 2008). Recently, several randomized algorithms have been devised that break the Omega(log N) barrier and need only o(log N) RMRs per passage in expectation (see Hendler and Woelfel, 2010, Hendler and Woelfel, 2011, and Bender and Gilbert, 2011). In this paper we present the first randomized "abortable" mutual exclusion algorithm that achieves a sub-logarithmic expected RMR complexity. More precisely, against a weak adversary (which can make scheduling decisions based on the entire past history, but not the latest coin-flips of each process) every process needs an expected number of O(log N/ log log N) RMRs to enter end exit the critical section. If a process receives an abort-signal, it can abort an attempt to enter the critical section within a finite number of its own steps and by incurring O(log N/ log log N) RMRs.

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

↑