Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
How to assign votes in a distributed system
Journal of the ACM (JACM)
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Computers
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Recognizing Nondominated Coteries and wr-Coteries by Availability
IEEE Transactions on Parallel and Distributed Systems
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Distributed and Parallel Databases
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient selection and sorting schemes using coteries for processing large distributed files
Journal of Parallel and Distributed Computing
A New Quorum-Based Scheme for Managing Replicated Data in Distributed Systems
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Quorum-Based Algorithms for Group Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Revisiting Hierarchical Quorum Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
(h, k)-Arbiters for h-out-of-k mutual exclusion problem
Theoretical Computer Science
k-Coteries for Tolerating Network 2-Partition
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Quorum-Based Energy Conserving Protocol for IEEE 802.11 Ad Hoc Networks
IEEE Transactions on Mobile Computing
Quorum-based power-saving multicast protocols in the asynchronous ad hoc network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Info-based approach in distributed mutual exclusion algorithms
Journal of Parallel and Distributed Computing
Load-aware energy-efficient medium access control for Wireless Sensor Networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.01 |
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. Recently, some mutual exclusion algorithms successfully use logical structures to construct coteries with small quorums sizes. In this paper, we introduce a geometric approach on dealing with the logical structures and present some useful geometric properties for constructing coteries and k-coteries. Based on those geometric properties, a logical structure named three-sided graph is proposed to provide a new scheme for constructing coteries with small quorums: The smallest quorum size is $O(\sqrt N)$ in a homogeneous system with N nodes and O(1) in a heterogeneous system. In addition, we also extend the three-sided graph to the n-sided graph for constructing k-coteries.