Coordinating concurrent access to a shared resource using mutual exclusion is a fundamental problem in computation. In this paper, we present a novel approach to mutual exclusion designed specifically for distributed systems leveraging a popular network communication technology, remote direct memory access (RDMA). Our approach enables local processes to avoid using RDMA operations entirely, limits the number of RDMA operations required by remote processes, and guarantees both starvation-freedom and fairness.
翻译:利用相互排斥同时协调使用共享资源是一个根本的计算问题。 在本文中,我们提出了一种针对相互排斥的新办法,专门为利用大众网络通信技术、远程直接存取(RDMA)的分布式系统设计的相互排斥办法。 我们的方法使当地程序能够避免完全使用RDMA操作,限制远程程序所需的RDMA操作数量,并保障饥饿自由和公平。