A locking protocol for resource coordination in distributed databases

Authors:
Daniel A. Menasce;Gerald J. Popek;Richard R. Muntz
Affiliations:
University of California, Los Angeles, California;University of California, Los Angeles, California;University of California, Los Angeles, California
Venue:
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Year:
1978

Citing 0
Cited 7

A survey of distributed deadlock detection algorithms

ACM SIGMOD Record
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Improvements in the time complexity of two message-optimal election algorithms

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A protocol for failure and recovery detection to support partitioned operation in distributed database systems

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
A Survey of Techniques for Synchronization and Recovery in Decentralized Computer Systems

ACM Computing Surveys (CSUR)
Distributed data base management: Some thoughts and analyses

ACM '80 Proceedings of the ACM 1980 annual conference
Strategies for handling transactions in distributed data base systems during recovery

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6

Quantified Score

Hi-index	0.00

Visualization

Abstract