![]() |
CiteULike | ![]() |
adriancolesa's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Timeliness, failure-detectors, and consensus performanceIn PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (2006), pp. 169-178.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework, GIRAF, for expressing such assumptions, and reasoning about the performance of indulgent algorithms.
BibTeX record
RIS record