Exploiting logical structures in replicated databases
- 10 January 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (5), 255-260
- https://doi.org/10.1016/0020-0190(90)90194-3
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A tree-based algorithm for distributed mutual exclusionACM Transactions on Computer Systems, 1989
- Efficient solution to the distributed mutual exclusion problemPublished by Association for Computing Machinery (ACM) ,1989
- How to assign votes in a distributed systemJournal of the ACM, 1985
- Consistency in a partitioned network: a surveyACM Computing Surveys, 1985
- A √N algorithm for mutual exclusion in decentralized systemsACM Transactions on Computer Systems, 1985
- Inexact agreementPublished by Association for Computing Machinery (ACM) ,1985
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976