Skip to Main content Skip to Navigation

A Scheduling Algorithm for Defeating Collusion

Louis-Claude Canon 1 Emmanuel Jeannot 1 Jon Weissman 2 
1 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 well-known unreliability of nodes. In this paper, we consider the most challenging threat model: organized groups of cheaters that may collude to produce incorrect results. By using a previously described on-line algorithm for detecting collusion and characterizing the participant behaviors, we propose a scheduling algorithm that tackles collusion. Using several real-life traces, we show that our approach min- imizes redundancy while maximizing the number of correctly certified results.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Emmanuel Jeannot Connect in order to contact the contributor
Submitted on : Friday, October 8, 2010 - 8:53:07 AM
Last modification on : Saturday, June 25, 2022 - 7:41:39 PM
Long-term archiving on: : Thursday, October 25, 2012 - 4:40:36 PM


Files produced by the author(s)


  • HAL Id : inria-00524493, version 1



Louis-Claude Canon, Emmanuel Jeannot, Jon Weissman. A Scheduling Algorithm for Defeating Collusion. [Research Report] RR-7403, INRIA. 2010. ⟨inria-00524493⟩



Record views


Files downloads