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)
Two algorithms for mutual exclusion in real-time distributed computer systems
Journal of Parallel and Distributed Computing
Performance evaluation of semantics-based multilevel concurrency control protocols
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
The Transis approach to high availability cluster communication
Communications of the ACM
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Designing an Efficient and Scalable Server-side Asynchrony Model for CORBA
OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
IEEE Transactions on Knowledge and Data Engineering
A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Distributed Peer-to-Peer Control in Harness
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Empirical Evaluation of Distributed Mutual Exclusion Algorithms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Fault-Tolerance for Token-based Synchronization Protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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
A Log(n) Multi-Mode Locking Protocol for Distributed Systems
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Scalable Distributed Concurrency Services for Hierarchical Locking
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Architecture and Object Model for Distributed Object-Oriented Real-Time Databases
ISORC '98 Proceedings of the The 1st IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Prioritized Token-Based Mutual Exclusion for Distributed Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
The design of the TAO real-time object request broker
Computer Communications
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 important as applications share computational resources in distributed environments, such as high-end clusters with ever larger number of processors, computational grids and increasingly large server farms. One of the main challenges in such environments is to achieve scalability of synchronization. In general, concurrency services arbitrate resource requests in distributed systems. But concurrency protocols currently lack scalability. Adding such guarantees enables resource sharing and computing with distributed objects in systems with a large number of nodes. The objective of our work is to enhance middleware services to provide scalability of synchronization and to support state replication in distributed systems. We have designed and implemented a middleware protocol in support of these objectives. Its essence is a peer-to-peer protocol for multi-mode hierarchical locking, which is applicable to transaction-style processing and distributed agreement. We demonstrate high scalability combined with low response times in high-performance cluster environments. Our technical contribution is a novel, fully decentralized, hierarchical locking protocol to enhance concurrency in distributed resource allocation following the specification of general concurrency services for large-scale data and object repositories. Our experiments on an IBM SP show that the number oF messages approaches an asymptote at 15 node from which point on the message overhead is in the order of 3-9 messages per request, depending on system parameters. At the same time, response times increase linearly with a proportional increase in requests and, consequently, higher concurrency levels. Specifically, in the range of up to 80 nodes, response times under 10 ms are observed for critical sections that are one 25th the size of noncritical code. The high degree of scalability and responsiveness of our protocol is due in large to a high level of concurrency upon resolving requests combined with dynamic path compression for request propagation paths. Our approach is not only applicable to CORBA, its principles are shown to provide benefits to general distributed concurrency services and transaction models. Besides its technical strengths, our approach is intriguing due to its simplicity and its wide applicability, ranging From large-scale clusters to server-style computing.