A Generic Local-Spin Fetch-and-φ-based Mutual Exclusion Algorithm∗

Local - spin Mutual Exclusion Using Fetch - and - φ Primitives ∗ ( Extended Abstract )

We present a generic fetch-and-φ-based local-spin mutual exclusion algorithm, with O(1) time complexity under the remote-memory-references time measure. This algorithm is “generic” in the sense that it can be implemented using any fetch-and-φ primitive of rank 2N , where N is the number of processes. The rank of a fetch-and-φ primitive is a notion introduced herein; informally, it expresses the...

Local-spin Mutual Exclusion Using Fetch-and- Primitives

We present a generic fetch-and-based local-spin mutual exclusion algorithm, with O(1) time complexity under the remote-memory-references time measure. This algorithm is \generic" in the sense that it can be implemented using any fetch-andprimitive of rank 2N , where N is the number of processes. The rank of a fetch-andprimitive is a notion introduced herein; informally, it expresses the extent ...

Local-spin Mutual Exclusion Using Fetch-and-\phi Primitives

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

Local-spin Algorithms for Variants of Mutual Exclusion Using Read and Write Operations

LOCAL-SPIN ALGORITHMS FOR VARIANTS OF MUTUAL EXCLUSION USING READ AND WRITE OPERATIONS Robert Danek Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2011 Mutual exclusion (ME) is used to coordinate access to shared resources by concurrent processes. We investigate several new N -process shared-memory algorithms for variants of ME, each of which uses only reads ...