\((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem

DOI10.1016/j.tcs.2003.08.003zbMath1071.68101OpenAlexW4210586736MaRDI QIDQ1884984

Yoshifumi Manabe, Naka Tajima

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.08.003

zbMATH Keywords

Mutual exclusionDistributed algorithmArbiterQuorum

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

On quorum systems for group resources allocation

Cites Work

• \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
• Another distributed algorithm for multiple entries to a critical section
• A taxonomy of distributed mutual exclusion
• A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie
• Distributed algorithms for multiple entries to a critical section with priority
• Nondominated \(k\)-coteries for multiple mutual exclusion
• A simple scheme to construct \(k\)-coteries with \(O(\sqrt{N})\) uniform quorum sizes
• How to assign votes in a distributed system
• Time, clocks, and the ordering of events in a distributed system
• Comments on "Availability of k-Coterie"
• Unnamed Item

This page was built for publication: \((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem