Using Data-Flow Analysis for Resilience and Result Checking in Peer-To-Peer Computations

Authors:
Samir Jafar;Sebastien Varrette;Jean-Louis Roch
Affiliations:
Projet APACHE (CNRS/INPG/INRIA/UJF), France;Projet APACHE (CNRS/INPG/INRIA/UJF), France;Projet APACHE (CNRS/INPG/INRIA/UJF), France
Venue:
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
Year:
2004

Citing 0
Cited 5

Building Secure Resources to Ensure Safe Computations in Distributed and Potentially Corrupted Environments

Euro-Par 2008 Workshops - Parallel Processing
A Probabilistic Fault-Tolerant Recovery Mechanism for Task and Result Certification of Large-Scale Distributed Applications

GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
A checkpoint/recovery model for heterogeneous dataflow computations using work-stealing

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
A probabilistic approach for task and result certification of large-scale distributed applications in hostile environments

EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
A signature scheme for distributed executions based on control flow analysis

SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

To achieve correct execution of peer-to-peer applications on non-reliable resources, we present a portable and distributed algorithm that provides fault tolerance and result checking. Two kinds of faults are considered: node failure or disconnection and result forgery. This algorithm is based on the knowledge of the macro data-flow dependencies between the application tasks. It provides correct execution with respect to a probabilistic certificate. We have implemented it on top of Athapascan programming interface and experimental results are presented.