Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,781 papers from all fields of science
Search
Sign In
Create Free Account
Paxos (computer science)
Known as:
Paxos (disambiguation)
, Paxos protocol
, Paxos distributed consensus algorithm
Expand
Paxos is a family of protocols for solving consensus in a network of unreliable processors.Consensus is the process of agreeing on one result among a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
Amazon Web Services
Apache Cassandra
Bitcoin
Byzantine fault tolerance
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Efficient verification of multi-property designs (The benefit of wrong assumptions)
E. Goldberg
,
Matthias Güdemann
,
D. Kroening
,
Rajdeep Mukherjee
Design, Automation and Test in Europe
2017
Corpus ID: 3844805
We consider the problem of efficiently checking a set of safety properties Ρ<inf>1</inf>,…,Ρ<inf>k</inf> of one design. We…
Expand
Highly Cited
2015
Highly Cited
2015
Raft Refloated: Do We Have Consensus?
H. Howard
,
Malte Schwarzkopf
,
Anil Madhavapeddy
,
J. Crowcroft
OPSR
2015
Corpus ID: 14399537
The Paxos algorithm is famously difficult to reason about and even more so to implement, despite having been synonymous with…
Expand
2012
2012
Model checking of linear-time properties in multi-valued systems
Yongming Li
,
M. Droste
,
Lihui Lei
Information Sciences
2012
Corpus ID: 2517783
2012
2012
The Logic of Events, a framework to reason about distributed systems
M. Bickford
,
R. Constable
,
Vincent Rahli
2012
Corpus ID: 60583024
We present a logical framework to reason about distributed systems called the Logic of Events. This logic has been formalized in…
Expand
2011
2011
JPaxos: State machine replication based on the Paxos protocol
Jan Kończak
,
Nuno Santos
,
Tomasz Żurkowski
,
P. Wojciechowski
,
A. Schiper
2011
Corpus ID: 11836210
State machine replication is a technique for making services fault-tolerant by replicating them over a group of machines…
Expand
2010
2010
Stateful Contracts for Affine Types
Jesse A. Tov
,
Riccardo Pucella
European Symposium on Programming
2010
Corpus ID: 14628487
Affine type systems manage resources by preventing some values from being used more than once. This offers expressiveness and…
Expand
Highly Cited
2005
Highly Cited
2005
Etna: A Fault-tolerant Algorithm for Atomic Mutable DHT Data
Athicha Muthitacharoen
,
Seth Gilbert
,
R. Morris
2005
Corpus ID: 2621251
This paper presents Etna, an algorithm for atomic reads and writes of replicated data stored in a distributed hash table. Etna…
Expand
Highly Cited
2004
Highly Cited
2004
Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures
Farn Wang
IEEE Transactions on Software Engineering
2004
Corpus ID: 14376759
We introduce a new BDD-like data structure called hybrid-restriction diagrams (HRDs) for the representation and manipulation of…
Expand
2004
2004
Performance comparison of a rotating coordinator and a leader based consensus algorithm
P. Urbán
,
Naohiro Hayashibara
,
A. Schiper
,
T. Katayama
Proceedings of the 23rd IEEE International…
2004
Corpus ID: 6561706
Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many…
Expand
Highly Cited
1994
Highly Cited
1994
The negotiating agents approach to runtime feature interaction resolution
N. Griffeth
,
H. Velthuijsen
FIW
1994
Corpus ID: 542569
This article describes how to use the Negotiating Agents approach on a telecommunications platform. Negotiation is used in this…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE