Michael Abd-El-Malek, Gregory R. Ganger, Garth R. Goodson +, Michael K....  Home/Search
Context
Related
| hp.com/personal/Ja...ElMalekSOSP05.pdf 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: hp.com/personal/Jay_Wylie/publ... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine faulttolerant services. The optimistic quorum-based nature of the Q/U protocol allows it to provide better throughput and fault-scalability than replicated state machines using agreement-based protocols. A prototype service built using the Q/U protocol outperforms the... (Update)
Active bibliography (related documents): More All
3.8: Fault-Scalable Byzantine Fault-Tolerant Services - Michael Abd-El-Malek Gregory (Correct)
0.5: Meets Paxos: Leader Election and Stability without Eventual .. - Malkhi, Oprea, al. (2005) (Correct)
0.3: Efficient Replica Maintenance for Distributed Storage Systems - Ung-Gon Chun Frank (2006) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ gregory-faultscalable,
author = "Michael Abd-El-Malek Gregory",
title = "Fault-Scalable Byzantine Fault-Tolerant Services",
url = "citeseer.ist.psu.edu/738920.html" }
Citations (may not include all citations):1209 Concurrency control and recovery in database systems (context) - Bernstein, Hadzilacos et al. - 1987
625 ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
401 The MD5 message-digest algorithm (context) - Rivest - 1992
350 Implementing fault-tolerant services using the state machine.. - Schneider - 1990
326 Linearizability: a correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
246 On optimistic methods for concurrency control (context) - Kung, Robinson - 1981
189 Keying hash functions for message authentication - Bellare, Canetti et al. - 1996
141 Byzantine quorum systems - Malkhi, Reiter - 1998
97 Asynchronous consensus and broadcast protocols (context) - Bracha, Toueg - 1985
85 and reliable storage for an incompletely trusted environment (context) - Adya, Bolosky et al. - 2002
85 The Rampart toolkit for building high-integrity services - Reiter - 1995
84 distributed data structures for internet service constructio.. (context) - Gribble, Brewer et al. - 2000
77 ACM Transactions on Computer Systems (context) - Lamport, parliament - 1998
56 PostMark: a new file system benchmark (context) - Katcher - 1997
55 Failure detection and consensus in the crash-recovery model - Aguilera, Chen et al. - 2000
55 Interactive consistency with multiple failure modes (context) - Thambidurai, Park - 1988
51 Pond: the OceanStore prototype - Rhea, Eaton et al. - 2003
49 The load and availability of Byzantine quorum systems - Malkhi, Reiter et al. - 1906
39 The implementation of reliable distributed multiprocess syst.. (context) - Lamport - 1978
28 RS: a high-availability scalable distributed data structure .. (context) - Litwin, Schwarz - 2000
27 An architecture for survivable coordination in large distrib.. - Malkhi, Reiter - 2000
26 Practical Byzantine fault tolerance and proactive recovery (context) - Castro, Liskov - 2002
23 Secure intrusion-tolerant replication on the Internet - Cachin, Poritz - 2002
22 and availability of quorum systems (context) - Naor, Wool et al. - 1998
20 Obstruction-free synchronization: double-ended queues as an .. (context) - Herlihy, Luchangco et al. - 2003
18 International Symposium on Distributed Computing (context) - Martin, Alvisi et al. - 2002
18 COCA: A secure distributed online certification authority - Zhou, Schneider et al. - 2002
16 ACM Transactions on Information and Systems Security (context) - Kihlstrom, Moser et al. - 2001
13 Quorum systems in replicated databases: science or fiction (context) - Wool - 1998
13 protocols for distributed mutual exclusion and ordering (context) - Chockler, Malkhi et al. - 2001
10 Collisions for Hash Functions MD (context) - Wang, Feng et al. - 2004
9 Storage: from atoms to people (context) - Morris - 2002
7 Are quorums an alternative for data replication (context) - Jimenez-Peris, Patino-Martnez et al. - 2003
4 Boxwood: abstractions as the foundation for storage infrastr.. - MacCormick, Murphy et al. - 2004
4 Fast Byzantine consensus - Martin, Alvisi - 2005
4 Chain replication for supporting high throughput and availab.. (context) - van Renesse, Schneider - 2004
2 Technical report CMU--PDL (context) - Abd-El-Malek, Ganger et al. - 2005
2 Symposium on Reliable Distributed Systems (context) - Kursawe, agreement - 2002
2 Published as SIGMOD Record (context) - Gray, Helland et al. - 1996
2 Nested objects in a Byzantine quorum-replicated system (context) - Fry, Reiter - 2004
Documents on the same site (http://www.hpl.hp.com/personal/Jay_Wylie/publications/): More
A Protocol Family for Versatile Survivable Storage - Infrastructures Garth Goodson (Correct)
Efficient Byzantine-tolerant erasure-coded storage - Garth Goodson Jay (2003) (Correct)
Byzantine-Tolerant Erasure-Coded Storage - Garth Goodson Jay (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