On quorum systems for group resources allocation
From MaRDI portal
Publication:2377138
DOI10.1007/s00446-010-0094-4zbMath1267.68074OpenAlexW1989143550MaRDI QIDQ2377138
Publication date: 28 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/245884/-1/42.pdf
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The availability of crumbling wall quorum systems
- On qualitatively independent partitions and related problems
- On the maximum number of qualitative independent partitions
- \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
- A Sperner-type theorem and qualitative independence
- Qualitative independence and Sperner problems for directed graphs
- A taxonomy of distributed mutual exclusion
- A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie
- Nondominated \(k\)-coteries for multiple mutual exclusion
- A simple scheme to construct \(k\)-coteries with \(O(\sqrt{N})\) uniform quorum sizes
- A simple group mutual \(l\)-exclusion algorithm.
- \((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem
- The availability of quorum systems
- A simple local-spin group mutual exclusion algorithm
- How to assign votes in a distributed system
- Orthogonal partitions and covering of graphs
- The Load, Capacity, and Availability of Quorum Systems
- The Load and Availability of Byzantine Quorum Systems
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Distributed Computing
- On Quorum Systems for Group Resources with Bounded Capacity
- On generalized graphs