Inexact Agreement: Accuracy, Precision, and Graceful Degradation (1985)
| Citations: | 42 - 2 self |
BibTeX
@INPROCEEDINGS{Mahaney85inexactagreement:,
author = {Stephen R. Mahaney and Fred B. Schneider},
title = {Inexact Agreement: Accuracy, Precision, and Graceful Degradation},
booktitle = {},
year = {1985},
pages = {237--249},
publisher = {ACM}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An Inexact Agreement protocol allows processors that each have a value approximating v to compute new values that are closer to each other and close to v . Two faulttolerant protocols for Inexact Agreement are described. As long as fewer than 1/3 of the processors are faulty, the protocols give the required convergence; they also permit iteration and thus convergence to any desired precision. When between 1/3 and 2/3 of the processors are faulty, the protocols may not converge. However, then processors either detect that too many faults have occurred or the new values computed by processors remain close to each other and to v . In this case, the divergence is bounded. Use of the protocols for clock synchronization in a distributed system is explained. 1.
Citations
| 1069 | The byzantine generals problem - Lamport, Shostak, et al. - 1982 |
| 193 | Synchronizing clocks in the presence of faults - Lamport, Melliar-Smith - 1985 |
| 130 | Byzantine generals in action: Implementing fail-stop processors - Schneider - 1984 |
| 120 | Dynamic faulttolerant clock synchronization - Dolev, Halpern, et al. - 1985 |
| 114 | The Byzantine generals strike again - Dolev - 1982 |
| 89 | Reaching approximate agreement in the presence of faults - Dolev, Lynch, et al. - 1986 |
| 75 | Mantaining the time in a distributed system - Marzullo, Owicki - 1985 |
| 55 | A new fault-tolerant algorithm for clock synchronization - Lundelius, Lynch - 1984 |
| 16 | M Melliar-Smith , Byzantine Clock Synchronization - Lamport, P - 1984 |
| 1 | Failing with Grace - Mahaney, Schneider - 1979 |
