A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Performance evaluation of semantics-based multilevel concurrency control protocols
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
IEEE Transactions on Knowledge and Data Engineering
A performance comparison of fast distributed mutual exclusion algorithms
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Priority assignment in real-time active databases
The VLDB Journal — The International Journal on Very Large Data Bases
Priority Inheritance and Ceilings for Distributed Mutual Exclusion
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Prioritized Token-Based Mutual Exclusion for Distributed Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Granularity of locks in a shared data base
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
The design of the TAO real-time object request broker
Computer Communications
Scalable hierarchical locking for distributed systems
Journal of Parallel and Distributed Computing - Special issue on middleware
Scalable, fault tolerant membership for MPI tasks on HPC systems
Proceedings of the 20th annual international conference on Supercomputing
| Hi-index | 0.00 |
Middleware components are becoming increasingly importantas applications share computational resources indistributed environments. One of the main challenges insuch environments is to achieve scalability of concurrencycontrol. Existing concurrency protocols lack scalability.Scalability enables resource sharing and computing withdistributed objects in systems with a large number of nodes.We have designed and implemented a novel, scalable andfully decentralized middleware concurrency control protocol.Our experiments on a Linux cluster indicate that anaverage number of three messages is required per lock requeston a system with as many as 120, which is a logarithmicasymptote. At the same time, the response timefor the requests scales linearly with the increase in concurrencylevel. A comparison to another scalable concurrencyprotocol shows that our protocol results in significantlysuperior asymptotic savings in message overheadand response time for large number of nodes. While ourapproach follows the specification of general CORBA concurrencyservices for large-scale data and object repositories,the principles are applicable to any distributed concurrencyservices and transaction models. The results ofthis work impact scalability for distributed computing facilitiesranging from embedded computing with distributedobjects over peer-to-peer computing environments to arbitratingaccesses in very large database environments.