A protocol for scalable distributed concurrency services

Authors:
Nirmit Desai
Affiliations:
North Carolina State University, Raleigh, NC
Venue:
OOPSLA '02 Companion of the 17th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Year:
2002

Citing 6
Cited 0

A tree-based algorithm for distributed mutual exclusion

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
Multi-granularity locking for nested transactions: a proof using a possibilities mapping

Acta Informatica
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
Prioritized Token-Based Mutual Exclusion for Distributed Systems

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium

Quantified Score

Hi-index	0.01

Visualization

Abstract

As researchers share computational resources, such as objects in large distributed environments, it becomes difficult to achieve scalability of synchronization. Concurrency protocols currently lack scalability. Our protocol enhances middleware concurrency services to provide scalability of synchronization enabling resource sharing and computing with distributed objects in systems with a large number of nodes.