Skip to Main content Skip to Navigation
Conference papers

A Dynamic Approach for Characterizing Collusion in Desktop Grids

Louis-Claude Canon 1, 2 Emmanuel Jeannot 1, 2 Jon Weissman 3 
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 RUNTIME - Efficient runtime systems for parallel architectures
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : By exploiting idle time on volunteer machines, desktop grids provide a way to execute large sets of tasks with negligible maintenance and low cost. Although desktop grids are attractive for cost-conscious projects, relying on external resources may compromise the correctness of application execution due to the wellknown unreliability of nodes. In this paper, we consider the most challenging threat model: organized groups of cheaters that may collude to produce incorrect results. We propose two on-line algorithms for detecting collusion and characterizing the participant behaviors. Using several real-life traces, we show that our approach is accurate and efficient in identifying collusion and in estimating group behavior.
Complete list of metadata
Contributor : Emmanuel Jeannot Connect in order to contact the contributor
Submitted on : Tuesday, December 15, 2009 - 1:36:00 PM
Last modification on : Saturday, June 25, 2022 - 7:41:33 PM

Links full text




Louis-Claude Canon, Emmanuel Jeannot, Jon Weissman. A Dynamic Approach for Characterizing Collusion in Desktop Grids. 24th IEEE International Parallel and Distributed Processing Symposium - IPDPS 2010, Apr 2010, Atlanta, United States. pp.1-12, ⟨10.1109/IPDPS.2010.5470422⟩. ⟨inria-00441256⟩



Record views