Fair group mutual exclusion

DOI10.1145/872035.872077zbMATH Open1321.68169OpenAlexW2141927253MaRDI QIDQ2943764FDOQ2943764

Authors: Prasad Jayanti, Srdjan Petrovic, King Tan 

Publication date: 4 September 2015

Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/872035.872077

Recommendations

• Space-efficient FCFS group mutual exclusion
• Group mutual exclusion algorithms based on ticket orders
• Group mutual exclusion in linear time and space
• Local-Spin Group Mutual Exclusion Algorithms
• A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Local-Spin Group Mutual Exclusion Algorithms
• Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
• A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
• Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
• Asynchronous group mutual exclusion
• Space-efficient FCFS group mutual exclusion
• Group mutual exclusion in linear time and space
• Group mutual exclusion algorithms based on ticket orders
• A note of Raymond's tree based algorithm for distributed mutual exclusion

This page was built for publication: Fair group mutual exclusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943764)