| タイトル | Accelerated convergence for synchronous approximate agreement |
| 著者（英） | Park, S. K.; Sjogren, J. A.; Kearns, J. P. |
| 著者所属（英） | NASA Langley Research Center |
| 発行日 | 1988-11-01 |
| 言語 | eng |
| 内容記述 | The protocol for synchronous approximate agreement presented by Dolev et. al. exhibits the undesirable property that a faulty processor, by the dissemination of a value arbitrarily far removed from the values held by good processors, may delay the termination of the protocol by an arbitrary amount of time. Such behavior is clearly undesirable in a fault tolerant dynamic system subject to hard real-time constraints. A mechanism is presented by which editing data suspected of being from Byzantine-failed processors can lead to quicker, predictable, convergence to an agreement value. Under specific assumptions about the nature of values transmitted by failed processors relative to those transmitted by good processors, a Monte Carlo simulation is presented whose qualitative results illustrate the trade-off between accelerated convergence and the accuracy of the value agreed upon. |
| NASA分類 | COMPUTER PROGRAMMING AND SOFTWARE |
| レポートNO | 89N18474 |
| 権利 | Copyright, Distribution within the U.S. granted by agreement |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/232806 |
