Leslie Lamport, Mike Massa  Home/Search
Context
Related
| microsoft.com/user...nsubmission.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: microsoft.com/u...tml#timeclocks (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Asynchronous algorithms for implementing a faulttolerant distributed system, which can make progress despite the failure of any F processors, require 2F + 1 processors. Cheap Paxos, a variant of the Paxos algorithm, guarantees liveness under the additional assumption that the set of nonfaulty processors does not "jump around" too fast, but uses only F + 1 main processors that actually execute the system and F auxiliary processors that are used only to handle the failure of a main processor. The ... (Update)
Active bibliography (related documents): More All
0.3: How Fast Can Eventual Synchrony Lead to Consensus? - Dutta, Guerraoui, Lamport (2005) (Correct)
0.2: Consensus on Transaction Commit - Jim Gray And (2003) (Correct)
0.2: Lower Bounds for Asynchronous Consensus - Lamport (2004) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: FATOMAS - A Fault-Tolerant Mobile Agent System Based on the.. - Pleisch, Schiper (2001) (Correct)
0.1: Dependability and Its Threats: A Taxonomy - Avizienis, Laprie, Randell (Correct)
0.1: TCP Server Fault Tolerance Using Connection Migration to.. - Marwah, Mishra, Fetzer (2003) (Correct)
BibTeX entry: (Update)
@misc{ lamport-cheap,
author = "Leslie Lamport and Mike Massa",
title = "Cheap Paxos",
url = "citeseer.ist.psu.edu/lamport04cheap.html" }
Citations (may not include all citations):917 and the ordering of events in a distributed system (context) - Lamport, clocks - 1978
350 Implementing fault-tolerant services using the state machine.. - Schneider - 1990
214 Consensus in the presence of partial synchrony - Dwork, Lynch et al. - 1988
90 Replication in the harp file system - Liskov, Ghemawat et al. - 1991
39 The implementation of reliable distributed multiprocess syst.. (context) - Lamport - 1978
31 How to build a highly available system using consensus - Lampson - 1996
28 The part-time parliament - Lamport - 1998
11 Revisiting the paxos algorithm - De Prisco, Lampson et al. - 2000
8 Voting with regenerable volatile witnesses - Paris, Long - 1991
5 Distributed Computing Column (context) - Lamport, simple et al. - 2001
Documents on the same site (http://research.microsoft.com/users/lamport/pubs/pubs.html#time-clocks): More
Lower Bounds on Consensus - Lamport (2000) (Correct)
High-Level Specifications: Lessons from Industry - Batson, Lamport (2003) (Correct)
Formal Specification of a Web Services Protocol - Johnson (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC