• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Fault-scalable Byzantine fault-tolerant services (2005)

Cached

  • Download as a PDF

Download Links

  • [www.cs.unc.edu]
  • [www.ece.cmu.edu]
  • [users.ece.cmu.edu]
  • [users.ece.cmu.edu]
  • [users.ece.cmu.edu]
  • [www.cs.umass.edu]
  • [people.cs.umass.edu]
  • [people.cs.umass.edu]
  • [people.cs.umass.edu]
  • [www.cs.cornell.edu]
  • [www.hpl.hp.com]
  • [www.pdl.cmu.edu]
  • [www.pdl.cs.cmu.edu]
  • [www.cs.cornell.edu]
  • [cs.brown.edu]
  • [users.ece.cmu.edu]
  • [www.cs.cornell.edu]
  • [pdl.cmu.edu]
  • [users.ece.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Michael Abd-el-malek , Gregory R. Ganger , Garth R. Goodson , Michael K. Reiter , Jay J. Wylie
Venue:In Proceedings of the 20th ACM Symposium on Operating Systems Principles
Citations:144 - 6 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Abd-el-malek05fault-scalablebyzantine,
    author = {Michael Abd-el-malek and Gregory R. Ganger and Garth R. Goodson and Michael K. Reiter and Jay J. Wylie},
    title = {Fault-scalable Byzantine fault-tolerant services},
    booktitle = {In Proceedings of the 20th ACM Symposium on Operating Systems Principles},
    year = {2005},
    pages = {59--74},
    publisher = {ACM Press}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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 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%.

Keyphrases

fault-scalable byzantine fault-tolerant service    replicated state machine decrease    prototype service    optimistic quorum-based nature    fault-scalable byzantine faulttolerant service    byzantine fault    fault-scalable service    significant decrease    protocol decrease    popular replicated state machine implementation    new tool    agreement-based protocol    optimistic execution    replicated state machine    query update   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University