Improving the Fault Tolerance of Algorithms
Hagit Attiya, Jennifer Lundelius Welch · Distributed Computing · 2004
This chapter presents methods to automatically translate algorithms designed to tolerate more benign faults into algorithms that can tolerate more severe faults, in the message passing model. In particular, translations are given for Byzantine to identical Byzantine, identical Byzantine to omission, and omission to crash. Application to the consensus problem is described.