Deriving a Scalable Algorithm for Mutual Exclusion
نویسنده
چکیده
This paper details the design of a scalable algorithm for the mutual exclusion problem. Starting by inserting a redundant assignment into Peterson's algorithm for two processes, we derive another algorithm that uses only local spins, i.e., a process busy-waits only on locally accessible shared variables. The new two-process algorithm is then adapted to serve as a building block of the complete tournament-like algorithm; the adaptation is such that the entire algorithm still uses only local spins, which is crucial for scalability. We consider the simplicity of the algorithm and its derivation to be the main contributions of this paper.
منابع مشابه
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...
متن کاملFast and Scalable Mutual Exclusion
We present an N -process algorithm for mutual exclusion under read/write atomicity that has O(1) time complexity in the absence of contention and (logN) time complexity under contention, where \time" is measured by counting remote memory references. This is the rst such algorithm to achieve these time complexity bounds. Our algorithm is obtained by combining a new \fast-path" mechanism with an ...
متن کاملTitle of Dissertation: Scalable Synchronization in Shared Memory Multiprocessing Systems Scalable Synchronization in Shared Memory Multiprocessing Systems
Title of Dissertation: Scalable Synchronization in Shared Memory Multiprocessing Systems Jae-Heon Yang, Doctor of Philosophy, 1994 Dissertation directed by: Assistant Professor James H. Anderson Department of Computer Science It is our thesis that scalable synchronization can be achieved with only minimal hardware support, speci cally read/write atomicity. This is contrary to the conventional v...
متن کاملA Permission based Multilevel Parallel Solution for Distributed Mutual Exclusion
Due to the growing application of peer-to-peer computing, the distributed applications are continuously spreading over an extensive number of nodes. To cope with this large number of participants, various cluster based hierarchical solutions have been proposed. Cluster or group based solutions are scalable for a large number of participants. All of these solutions exploit the idea of coordinato...
متن کاملWeighted Mutual Exclusion Bootstrapping for Domain Independent Lexicon and Template Acquisition
We present the Weighted Mutual Exclusion Bootstrapping (WMEB) algorithm for simultaneously extracting precise semantic lexicons and templates for multiple categories. WMEB is capable of extracting larger lexicons with higher precision than previous techniques, successfully reducing semantic drift by incorporating new weighting functions and a cumulative template pool while still enforcing mutua...
متن کامل