Locally scalable randomized consensus for synchronous crash failures

doi:10.1145/1583991.1584063

Locally scalable randomized consensus for synchronous 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

Published in:

	· Proceeding
	SPAA '09 Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
	ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-606-9 doi>10.1145/1583991.1584063

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 14 · 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:
- SPAA '12

Tags: algorithms bit communication complexity consensus fault tolerance fault-tolerance graph expansion lower bound message passing performance randomization reliability routing and layout scalability synchrony theory tradeoffs among complexity measures

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player