Article

How to Build a Highly Available System Using Consensus

Author:

Butler W. LampsonAuthors Info & Claims

WDAG '96: Proceedings of the 10th International Workshop on Distributed Algorithms

Pages 1 - 17

Published: 09 October 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Howard HMortier RSzekeres ASivaramakrishnan K(2022)Relaxed PaxosProceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3517209.3524040(16-23)Online publication date: 5-Apr-2022
https://dl.acm.org/doi/10.1145/3517209.3524040
Brooker MChen TPing FBhagwan RPorter G(2020)Millions of tiny databasesProceedings of the 17th Usenix Conference on Networked Systems Design and Implementation10.5555/3388242.3388276(463-478)Online publication date: 25-Feb-2020
https://dl.acm.org/doi/10.5555/3388242.3388276
Howard HMortier RFekete AKleppmann M(2020)Paxos vs RaftProceedings of the 7th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3380787.3393681(1-9)Online publication date: 27-Apr-2020
https://dl.acm.org/doi/10.1145/3380787.3393681
Show More Cited By

Recommendations

Configuring highly available clusters using hacmp 4.5
Uniform consensus is harder than consensus

We compare the consensus and uniform consensus problems in synchronous systems. In contrast to consensus, uniform consensus is not solvable with byzantine failures. This still holds for the omission failure model if a majority of processes may be ...
The k-simultaneous consensus problem

This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is ...

Comments

Information & Contributors

Information

Published In

WDAG '96: Proceedings of the 10th International Workshop on Distributed Algorithms

October 1996

379 pages

ISBN:3540617698

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 09 October 1996

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Howard HMortier RSzekeres ASivaramakrishnan K(2022)Relaxed PaxosProceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3517209.3524040(16-23)Online publication date: 5-Apr-2022
https://dl.acm.org/doi/10.1145/3517209.3524040
Brooker MChen TPing FBhagwan RPorter G(2020)Millions of tiny databasesProceedings of the 17th Usenix Conference on Networked Systems Design and Implementation10.5555/3388242.3388276(463-478)Online publication date: 25-Feb-2020
https://dl.acm.org/doi/10.5555/3388242.3388276
Howard HMortier RFekete AKleppmann M(2020)Paxos vs RaftProceedings of the 7th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3380787.3393681(1-9)Online publication date: 27-Apr-2020
https://dl.acm.org/doi/10.1145/3380787.3393681
Zheng JLin QXu JWei CZeng CYang PZhang Y(2017)PaxosStoreProceedings of the VLDB Endowment10.14778/3137765.313777810:12(1730-1741)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.14778/3137765.3137778
Bushkov VGuerraoui RGeorgiou CSpirakis P(2015)Safety-Liveness Exclusion in Distributed ComputingProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767401(227-236)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767401
Van Renesse RAltinbuken D(2015)Paxos Made Moderately ComplexACM Computing Surveys10.1145/267357747:3(1-36)Online publication date: 17-Feb-2015
https://dl.acm.org/doi/10.1145/2673577
Stamatakis DTsikoudis NSmyrnaki OMagoutis K(2012)Scalability of replicated metadata services in distributed file systemsProceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems10.1007/978-3-642-30823-9_3(31-44)Online publication date: 13-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30823-9_3
Lamport LMalkhi DZhou L(2010)Reconfiguring a state machineACM SIGACT News10.1145/1753171.175319141:1(63-73)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1145/1753171.1753191
Chockler GGilbert SGramoli VMusial PShvartsman A(2009)Reconfigurable distributed storage for dynamic networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2008.07.00769:1(100-116)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1016/j.jpdc.2008.07.007
Hupfeld FKolbeck BStender JHögqvist MCortes TMartí JMalo J(2009)FaTLeaseCluster Computing10.1007/s10586-009-0074-212:2(175-188)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1007/s10586-009-0074-2
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Configuring highly available clusters using hacmp 4.5

Uniform consensus is harder than consensus

The k-simultaneous consensus problem

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations