系统范围崩溃下的常量RMR可恢复互斥量
Constant RMR Recoverable Mutex under System-wide Crashes
摘要：
我们设计了两个可恢复互斥（RME）锁的系统范围内的崩溃模型。我们的第一个算法只需要$O(1)$空间，每个进程，并实现$O(1)$最坏情况下的RMR复杂度的CC模型。我们的第二个算法增强了第一个算法，以实现（相同的）每个进程的$O(1)$空间和$O(1)$最坏情况下的RMR复杂度在CC和DSM模型。此外，这两种算法都允许动态创建的任意名称的线程加入协议并访问锁。据我们所知，只有这些RME锁可以实现最差情况下的$O(1)$ RMR复杂性，前提是仅支持标准硬件。根据Chan和Woelfel的$Ω(\log n / \log\log n)$最坏情况下的RME RMR下限在个别碰撞模型，我们的研究结果表明，在CC和DSM模型的最坏情况下的RMR复杂性的系统范围内的崩溃和个别崩溃模型之间的分离。
英文摘要：
We design two Recoverable Mutual Exclusion (RME) locks for the system-wide crash model. Our first algorithm requires only $O(1)$ space per process, and achieves $O(1)$ worst-case RMR complexity in the CC model. Our second algorithm enhances the first algorithm to achieve (the same) $O(1)$ space per process and $O(1)$ worst-case RMR complexity in both the CC and DSM models. Furthermore, both algorithms allow dynamically created threads of arbitrary names to join the protocol and access the locks. To our knowledge, these are the only RME locks to achieve worst-case $O(1)$ RMR complexity assuming nothing more than standard hardware support. In light of Chan and Woelfel's $Ω(\log n / \log\log n)$ worst-case RMR lower bound for RME in the individual crash model, our results show a separation between the system-wide crash and individual crash models in worst-case RMR complexity in both the CC and DSM models.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
