Wait-free regular storage from Byzantine components
We consider the problem of implementing a wait-free regular register from storage components prone to Byzantine faults. We present a simple, efficient, and self-contained construction of such a register. Our construction utilizes a novel building block, called a I-regular register, which can be efficiently implemented from Byzantine fault-prone components. (c) 2006 Elsevier B.V. All rights reserved.
distributed computing