Sciweavers

Share
AP2PS
2009
IEEE

Algorithm-Based Fault Tolerance Applied to P2P Computing Networks

10 years 5 months ago
Algorithm-Based Fault Tolerance Applied to P2P Computing Networks
—P2P computing platforms are subject to a wide range of attacks. In this paper, we propose a generalisation of the previous disk-less checkpointing approach for fault-tolerance in High Performance Computing systems. Our contribution is in two directions: first, instead of restricting to 2D checksums that tolerate only a small number of node failures, we propose to base disk-less checkpointing on linear codes to tolerate potentially a large number of faults. Then, we compare and analyse the use of Low Density Parity Check (LDPC) to classical Reed-Solomon (RS) codes with respect to different fault models to fit P2P systems. Our LDPC disk-less checkpointing method is well suited when only node disconnections are considered, but cannot deal with byzantine peers. Our RS disk-less checkpointing method tolerates such byzantine errors, but is restricted to exact finite field computations. Keywords-ABFT; P2P; distributed computing; SUMMA; linear coding; fault-tolerance
Thomas Roche, Mathieu Cunche, Jean-Louis Roch
Added 02 Sep 2010
Updated 02 Sep 2010
Type Conference
Year 2009
Where AP2PS
Authors Thomas Roche, Mathieu Cunche, Jean-Louis Roch
Comments (0)
books