Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/800215.806583acmconferencesArticle/Chapter ViewAbstractPublication PagessospConference Proceedingsconference-collections
Article
Free access

Weighted voting for replicated data

Published: 10 December 1979 Publication History

Abstract

In a new algorithm for maintaining replicated data, every copy of a replicated file is assigned some number of votes. Every transaction collects a read quorum of rvotes to read a file, and a write quorum of wvotes to write a file, such that r+w is greater than the total number of votes assigned to the file. This ensures that there is a non-null intersection between every read quorum and every write quorum. Version numbers make it possible to determine which copies are current. The reliability and performance characteristics of a replicated file can be controlled by appropriately choosing r, w, and the file's voting configuration. The algorithm guarantees serial consistency, admits temporary copies in a natural way by the introduction of copies with no votes, and has been implemented in the context of an application system called Violet.

References

[1]
Eswaran, K.P. et al The Notions of Consistency and Predicate Locks in a Database System, Comm. ACM 19. 11 (November 1976), pp. 624-633.
[2]
Gifford, D.K. Violet, An Experimental Decentralized System, Integrated Office System Workshop, IRIA, Rocquencourt, France, November, 1979. Available as CSL Report 79-12, Xerox Palo Alto Research Center, 1979.
[3]
Gray, J.N. et al Granularity of Locks and Degrees of Consistency in a Shared Data Base, in Modeling in Data Base Management Systems, North Holland Publishing, 1976, pp. 365-394.
[4]
Gray, J.N. Notes on Data Base Operating Systems, in Operating Systems, An Advanced Course, Lecture Notes in Computer Science 60, Springer-Verlag, 1978, pp. 393-481.
[5]
Israel, J.E., Mitchell, J.G., and Sturgis, H.E. Separating Data From Function in a Distributed File System, Second International Symposium on Exploratory Systems, IRIA, Rocquencourt, France, October, 1978.
[6]
Lampson, B.W., and Redell, D.D. Experience with Processes and Monitors in Mesa, to appear in Proceedings of the Seventh Symposium on Operating System Principles, ACM Operating Systems Review.
[7]
Lampson, B.W., and Sturgis, H.E. Crash Recovery in a Distributed Data Storage System, Comm. ACM, to appear.
[8]
Mitchell, J.G. et al, Mesa Language Manual. CSL Report 79-3, Xerox Palo Alto Research Center, February, 1979
[9]
Rothnie, J.B., Goodman, N., and Bernstein, P.A., The Redundant Update Methodology of SDD-1: A System for Distributed Databases (The Fully Redundant Case), Rep. No. CCA-77-02, Computer Corporation of America, 1977.
[10]
Stonebraker, M. Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES, IEEE Trans. on Soft. Eng.5. 3(May 1979), pp. 188-194
[11]
Thomas, R.H. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases, ACM Trans. on Database Systems4,2(June 1979), pp. 180-209.

Cited By

View all
  • (2024)PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation Mechanisms2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00156(1930-1943)Online publication date: 13-May-2024
  • (2024)Asymmetric distributed trustDistributed Computing10.1007/s00446-024-00469-137:3(247-277)Online publication date: 28-May-2024
  • (2024)Boosting Multimode Ruling in DHR Architecture With Metamorphic RelationsSoftware Testing, Verification and Reliability10.1002/stvr.1890Online publication date: 23-Jul-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SOSP '79: Proceedings of the seventh ACM symposium on Operating systems principles
December 1979
163 pages
ISBN:0897910095
DOI:10.1145/800215
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 December 1979

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Computer network
  2. File suite
  3. File system
  4. Locking
  5. Quorum
  6. Replicated data
  7. Representative
  8. Transaction
  9. Weak representative
  10. Weighted voting

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 131 of 716 submissions, 18%

Upcoming Conference

SOSP '24

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)374
  • Downloads (Last 6 weeks)39
Reflects downloads up to 03 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2024)PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation Mechanisms2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00156(1930-1943)Online publication date: 13-May-2024
  • (2024)Asymmetric distributed trustDistributed Computing10.1007/s00446-024-00469-137:3(247-277)Online publication date: 28-May-2024
  • (2024)Boosting Multimode Ruling in DHR Architecture With Metamorphic RelationsSoftware Testing, Verification and Reliability10.1002/stvr.1890Online publication date: 23-Jul-2024
  • (2023)FUSEEProceedings of the 21st USENIX Conference on File and Storage Technologies10.5555/3585938.3585944(81-97)Online publication date: 21-Feb-2023
  • (2023)Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus AlgorithmsACM Computing Surveys10.1145/363655356:5(1-41)Online publication date: 9-Dec-2023
  • (2023)Loom: A Closed-Box Disaggregated Database SystemProceedings of the 12th Latin-American Symposium on Dependable and Secure Computing10.1145/3615366.3615424(30-39)Online publication date: 16-Oct-2023
  • (2023)Accelerating Cloud-Native Databases with Distributed PMem Stores2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00233(3043-3057)Online publication date: Apr-2023
  • (2023)How Hard is Asynchronous Weight Reassignment?2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00038(523-533)Online publication date: Jul-2023
  • (2023)NoSQL-based storage systems: influence of consistency on performance, availability and energy consumptionThe Journal of Supercomputing10.1007/s11227-023-05488-679:18(21424-21448)Online publication date: 20-Jun-2023
  • (2023)Permissionless and asynchronous asset transferDistributed Computing10.1007/s00446-023-00449-x36:3(349-371)Online publication date: 18-May-2023
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media