解构基于交换的互斥

摘要：

我们制定了一个模块化的方法来设计和分析一类特定的互斥算法共享内存多处理器系统。具体来说，我们考虑的算法，组织成一个队列的等待过程。这样的算法可以实现O（1）的远程内存引用（RMR）复杂度，这使得通过处理器-内存互连的流量最小化（渐近地）。我们首先描述了一个通用的互斥算法，它依赖于一个特定的类队列的数据结构，我们称之为MutexQueue的线性实现。接下来，我们展示了MutexQueue的两个实现，每个操作使用O（1）RMR，基于多处理器中常用的同步原语。这些实现紧密遵循嵌入在先前公布的互斥算法的排队代码。我们提供严格的正确性证明和RMR复杂性分析的算法，我们提出。

英文摘要：

We formulate a modular approach to the design and analysis of a particular class of mutual exclusion algorithms for shared memory multiprocessor systems. Specifically, we consider algorithms that organize waiting processes into a queue. Such algorithms can achieve O(1) remote memory reference (RMR) complexity, which minimizes (asymptotically) the amount of traffic through the processor-memory interconnect. We first describe a generic mutual exclusion algorithm that relies on a linearizable implementation of a particular queue-like data structure that we call MutexQueue. Next, we show two implementations of MutexQueue using O(1) RMRs per operation based on synchronization primitives commonly available in multiprocessors. These implementations follow closely the queuing code embedded in previously published mutual exclusion algorithms. We provide rigorous correctness proofs and RMR complexity analyses of the algorithms we present.

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