SIGN IN
SIGN UP
The weakest failure detector for solving consensus
Full Text:
PDF
Buy this Article
Authors:
Tushar Deepak Chandra
IBM T.J. Watson Research Center, Hawthorne, NY
Vassos Hadzilacos
Univ. of Toronto, Toronto, Ont., Canada
Sam Toueg
Cornell Univ., Ithaca, NY
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 43 Issue 4, July 1996
Pages 685-722
ACM
New York, NY
, USA
table of contents
doi>
10.1145/234533.234549
1996 Article
Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 151
· Downloads (cumulative): 1,558
· Citation Count: 227
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
byzantine generals'
problem
agreement problem
algorithms
asynchronous systems
atomic broadcast
automata
commit problem
concurrency
consensus problem
crash failures
distributed applications
distributed databases
distributed programming
failure detection
fault-tolerance
fault-tolerance
message passing
network operating systems
parallelism and concurrency
partial synchrony
processor failures
relations between models
reliability
reliability, availability, and serviceability
theory
transaction processing
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