The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Viewstamped replication: a general primary copy
Abstract
Article Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems Share on Authors: Brian M. Oki Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MAView Profile , Barbara H. Liskov Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MAView Profile Authors Info & Claims PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computingJanuary 1988 Pages 8–17https://doi.org/10.1145/62546.62549Online:01 January 1988Publication History 163citation2,063DownloadsMetricsTotal Citations163Total Downloads2,063Last 12 Months112Last 6 weeks17 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
The notions of consistency and predicate locks in a database system
Eswaran, K. P., Gray, J. N., Lorie, R. A., & Traiger, I. L. (1976) · Communications of the ACM · doi:10.1145/360363.360369 · Cited by 1,956
Notes on data base operating systems
Gray, J. N. (1978) · Lecture Notes in Computer Science · doi:10.1007/3-540-08755-9_9 · Cited by 1,656
Weighted voting for replicated data
Gifford, D. K. (1979) · Proceedings of the seventh symposium on Operating systems principles - SOSP '79 · doi:10.1145/800215.806583 · Cited by 1,323
The serializability of concurrent database updates
Papadimitriou, C. H. (1979) · Journal of the ACM · doi:10.1145/322154.322158 · Cited by 1,021
Reliable communication in the presence of failures
Birman, K. P., & Joseph, T. A. (1987) · ACM Transactions on Computer Systems · doi:10.1145/7351.7478 · Cited by 997
Fail-stop processors: an approach to designing fault-tolerant computing systems
Schlichting, R. D., & Schneider, F. B. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357371 · Cited by 769
A principle for resilient sharing of distributed resources
Alsberg, P. A., & Day, J. (1976) · doi:10.5555/800253.807732 · Cited by 416
Granularity of locks and degrees of consistency in a shared data base
Gray, J., Lorie, R. A., Putzolu, G. R., & Traiger, I. L. (1998) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 348
A quorum-consensus replication method for abstract data types
Herlihy, M. P. (1986) · ACM Transactions on Computer Systems · doi:10.1145/6306.6308 · Cited by 247
Cited by
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Self-citationLamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
“Viewstamped replication [Oki and Liskov 1988] and Paxos [Lamport 1989] use a combination of primary-backup [Alsberg and Day 1976] and quorum [Gifford 1979] techniques to tolerate benign faults in an asynchronous system.”
MethodSelf-citationThe Chubby lock service for loosely-coupled distributed systems
Burrows, M. (2006) · Operating Systems Design and Implementation · doi:10.5555/1298455.1298487 · Cited by 877
Paxos made live: an engineering perspective
Chandra, T. D., Griesemer, R., & Redstone, J. (2007) · Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing · doi:10.1145/1281100.1281103 · Cited by 619
Survey on blockchain for Internet of Things
Wang, X., Zha, X., Ni, W., Liu, R. P., Guo, Y. J., Niu, X., & Zheng, K. (2019) · Computer Communications · doi:10.1016/j.comcom.2019.01.006 · Cited by 567
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
Lloyd, W., Freedman, M. J., Kaminsky, M., & Andersen, D. G. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043593 · Cited by 565
A survey of blockchain consensus algorithms performance evaluation criteria
Bamakan, S. M. H., Motavali, A., & Babaei Bondarti, A. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113385 · Cited by 481
Distributed SDN Control: Survey, Taxonomy, and Challenges
Bannour, F., Souihi, S., & Mellouk, A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2782482 · Cited by 452
SBFT: A Scalable and Decentralized Trust Infrastructure
Golan Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.-A., Tamir, O., & Tomescu, A. (2019) · 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2019.00063 · Cited by 362
Zab: High-performance broadcast for primary-backup systems
Junqueira, F. P., Reed, B. C., & Serafini, M. (2011) · 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN) · doi:10.1109/dsn.2011.5958223 · Cited by 323
Replication in the harp file system
Liskov, B., Ghemawat, S., Gruber, R., Johnson, P., Shrira, L., & Williams, M. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121169 · Cited by 273
Self-citationWang, G., Shi, Z. J., Nixon, M., & Han, S. (2019) · Proceedings of the 1st ACM Conference on Advances in Financial Technologies · doi:10.1145/3318041.3355457 · Cited by 270
A Survey of Blockchain Consensus Protocols
Xu, J., Wang, C., & Jia, X. (2023) · ACM Computing Surveys · doi:10.1145/3579845 · Cited by 263
Metadata
- Authors
- Oki, B. M., & Liskov, B. H.
- Venue
- Proceedings of the seventh annual ACM Symposium on Principles of distributed computing - PODC '88
- Publisher
- ACM Press
- Published
- 1988
- Pages
- 8-17
- OpenAlex
- W2000832815
- Cited by
- 380
- References
- 13
- FWCI
- 6.41
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.