A Lower Bound for the Time to Assure Interactive Consistency (1981)
by
Michael J. Fischer
,
Nancy A. Lynch
,
Nancy A. Lynch
| Venue: | Information Processing Letters |
| Citations: | 122 - 12 self |
BibTeX
@ARTICLE{Fischer81alower,
author = {Michael J. Fischer and Nancy A. Lynch and Nancy A. Lynch},
title = {A Lower Bound for the Time to Assure Interactive Consistency},
journal = {Information Processing Letters},
year = {1981},
volume = {14},
pages = {183--186}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we answer this question in the negative. That is, we show that any algorithm which assures interactive consistency in the presence of m faulty processors re.quires at least m + I rounds of communication
Citations
| 75 | Using time instead of timeout for faulttolerant distributed systems - Lamport - 1984 |
| 48 | On describing the behavior and implementation of distributed systems - Lynch, Fischer - 1981 |
| 14 | Synchronization and matching in redundant systems - Davies, Wakerly - 1978 |
| 6 | The Byzantine generals - Dolev, Lamport, et al. - 1987 |
