Access Restriction

Author Ganger, Gregory R. ♦ Abd-El-Malek, Michael ♦ Reiter, Michael K. ♦ Goodson, Garth R. ♦ Wylie, Jay J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Services ♦ Quorums ♦ Byzantine fault-tolerance ♦ Replicated state machines ♦ Fault-scalability
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 fault-tolerant 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 same service built using a popular replicated state machine implementation at all system sizes in experiments that permit an optimistic execution. Moreover, the performance of the Q/U protocol decreases by only 36% as the number of Byzantine faults tolerated increases from one to five, whereas the performance of the replicated state machine decreases by 83%.
Description Affiliation: Carnegie Mellon University (Abd-El-Malek, Michael; Ganger, Gregory R.; Reiter, Michael K.; Wylie, Jay J.) || Network Appliance, Inc. (Goodson, Garth R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1975-04-01
Publisher Place New York
Journal ACM SIGOPS Operating Systems Review (OPSR)
Volume Number 39
Issue Number 5
Page Count 16
Starting Page 59
Ending Page 74

Open content in new tab

   Open content in new tab
Source: ACM Digital Library