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

一种在CC和DSM上均为次对数RMR的可恢复互斥算法

A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM

Prasad Jayanti, Siddhartha Jayanti, Anup Joshi

摘要:

鉴于非易失性主存技术的最新进展,Golab和Ramaraju将传统的互斥问题重新表述为新的{ \em可恢复互斥}(RME)问题。在最著名的RME解决方案中,由于PODC 2017中的Golab和Hendler,一个进程在每个通道中最多会引发$O(\frac{\log n}{\log \log n})$远程内存引用(RMR),其中通道是从进程进入Try部分到随后返回Remainder的时间间隔。然而,他们的算法,保证这一界限只为缓存一致性(CC)的多处理器,留下开放的问题,是否有类似的界限是可能的分布式共享内存(DSM)的多处理器。我们肯定地回答这个问题,通过设计一个算法,满足相同的复杂性约束Golab和Hendler的CC和DSM多处理器。我们的算法比Golab和Hendler的算法有一些额外的优点:(i)它的退出部分是无等待的,(ii)它只使用Fetch-and-Store指令,(iii)在CC机器上,我们的算法需要每个进程只有$O(1)$字的缓存,而他们的算法需要$O(n)$字。

英文摘要:

In light of recent advances in non-volatile main memory technology, Golab and Ramaraju reformulated the traditional mutex problem into the novel {\em Recoverable Mutual Exclusion} (RME) problem. In the best known solution for RME, due to Golab and Hendler from PODC 2017, a process incurs at most $O(\frac{\log n}{\log \log n})$ remote memory references (RMRs) per passage, where a passage is an interval from when a process enters the Try section to when it subsequently returns to Remainder. Their algorithm, however, guarantees this bound only for cache-coherent (CC) multiprocessors, leaving open the question of whether a similar bound is possible for distributed shared memory (DSM) multiprocessors. We answer this question affirmatively by designing an algorithm that satisfies the same complexity bound as Golab and Hendler's for both CC and DSM multiprocessors. Our algorithm has some additional advantages over Golab and Hendler's: (i) its Exit section is wait-free, (ii) it uses only the Fetch-and-Store instruction, and (iii) on a CC machine our algorithm needs each process to have a cache of only $O(1)$ words, while their algorithm needs $O(n)$ words.

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

↑