Algorithms for mutual exclusion
Algorithms for mutual exclusion
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault-tolerant mutual exclusion algorithms
Journal of Systems and Software - Special issue on distributed systems
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
A new fault tolerant distributed mutual exclusion algorithm
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
A new transformation method for nondominated coterie design
Information Sciences: an International Journal
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Advanced Concepts in Operating Systems
Advanced Concepts in Operating Systems
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Distributed Data Structures: A Complexity-Oriented View
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
A Robust Distributed Mutual Exclusion Algorithm
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Lock-based self-stabilizing distributed mutual exclusion algorithms
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Synchronization Algorithms and Concurrent Programming
Synchronization Algorithms and Concurrent Programming
| Hi-index | 0.00 |
We study the relation between two classical types of distributed locking mechanisms, called token-based locking and permission-based locking, and several distributed data structures which use locking for synchronization. We have proposed, implemented and tested several lock-based distributed data structures, namely, two different types of counters called find & increment and increment & publish, a queue, a stack and a linked list. For each one of them we have determined what is the preferred type of lock to be used as the underling locking mechanism. Furthermore, we have determined which one of the two proposed counters is better to be used either as a stand-alone data structure or when used as a building block for implementing other high level data structures.