S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
We define a new paradigm for distributed computing, almost-everywhere agreement, in which we require only that almost all correct processors reach consensus. Unlike the traditional Byzantine agreement problem, almost-everywhere agreement can be solved on networks of bounded degree. Specifically, we can simulate any sufficiently resilient Byzantine agreement algorithm on a network of bounded degree using our communication scheme described above. Although we 'lose' some correct processors, effectively treating them as faulty, the vast majority of correct processors decide on a common value.
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB