Title: A distributed algorithm for parameterized semaphore operations
Abstract: In distributed environments, many mutual exclusion algorithms have been proposed. These algorithms only control mutually exclusive access to a single resource. Several extensions to these basic mutual exclusion algorithms have been proposed, including (1) multiple mutual exclusion algorithms; (2) counting semaphores and (3) k-out-of-M resource synchronization primitives. However, none of these algorithms are as powerful as parameterized semaphore operations. This paper presents a distributed implementation of parameterized semaphore operations. The operations are as powerful as the centralized implementation. The authors assume that the system consists of N nodes, which are connected by a fully connected reliable, FIFO network.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Publication Year: 2003
Publication Date: 2003-01-02
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot