A simple taxonomy for distributed mutual exclusion algorithms-Reference-Cited by-同舟云学术

A simple taxonomy for distributed mutual exclusion algorithms

Published:1991-04 Issue:2 Volume:25 Page:47-50
ISSN:0163-5980
Container-title:ACM SIGOPS Operating Systems Review
language:en
Short-container-title:SIGOPS Oper. Syst. Rev.

Author:

Raynal Michel¹

Affiliation:

1. IRISA, Campus de Beaulieu, 35042 Rennes-Cedex

Abstract

This short paper examines the two basic principles from which distributed mutual exclusion algorithms are designed : permission-based and token-based principles. This presentation is done in a pedagogical way and is illustrated by references to existing algorithms.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/122120.122123

Reference25 articles.

1. Efficient solution to the distributed mutual exclusion problem

2. Exploiting logical structures in replicated databases

3. On the distribution of an assertion

4. A simple guide to five normal forms in relational database theory

5. The drinking philosophers problem

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An efficient failure-resilient mutual exclusion algorithm for distributed systems leveraging a novel zero-message overlay structure;Computer Communications;2024-03

2. Mutual Exclusion;Distributed Systems;2023-02-10

3. Fault-Tolerant Distributed Mutual Exclusion over Elastic Logical Ring Topology;Proceedings of Seventh International Congress on Information and Communication Technology;2022-07-12

4. Design and topological analysis of probabilistic distributed mutual exclusion algorithm with unbiased refined ordering;Future Generation Computer Systems;2019-06

5. A distributedk-mutual exclusion algorithm based on autonomic spanning trees;Journal of Parallel and Distributed Computing;2018-05