SIGN IN
SIGN UP
Fast scalable deterministic consensus for crash failures
Full Text:
PDF
Buy this Article
Authors:
Bogdan S. Chlebus
University of Colorado Denver, Denver, CO, USA
Dariusz R. Kowalski
University of Liverpool, Liverpool, United Kingdom
Michal Strojnowski
Uniwersytet Warszawski, Warszawa, Poland
Published in:
· Proceeding
PODC '09
Proceedings of the 28th ACM symposium on Principles of distributed computing
Pages 111-120
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-396-9
doi>
10.1145/1582716.1582738
2009 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 15
· Downloads (cumulative): 154
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
bit communication complexity
consensus
fault tolerance
fault-tolerance
graph expansion
message passing
performance
reliability
routing and layout
scalability
synchrony
theory
tradeoffs among complexity measures
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder