Abstract
Reference is made to an algorithm for achieving a kind of agreement called Byzantine Agreement. The general context for these agreements is a network of n processors that have a means for conducting several synchronized phases of information exchange after which they must all agree on some set of information. Byzantine Agreement results when, in the presence of undetected faulty processors, all correct processors are able to agree either on the value sent by the originator or on the conclusion that the originator is faulty. Crusader Agreement results when all those processors that do not know explicitly that the transmitter is faulty agree on the same value.
| Original language | English |
|---|---|
| Pages (from-to) | 1288-1290 |
| Number of pages | 3 |
| Journal | IBM technical disclosure bulletin |
| Volume | 26 |
| Issue number | 3 A |
| State | Published - 1983 |