A Scheduling Algorithm for Defeating Collusion - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

A Scheduling Algorithm for Defeating Collusion


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.
Fichier principal
Vignette du fichier
RR-7403.pdf (975.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00524493 , version 1 (08-10-2010)


  • 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⟩
131 View
116 Download


Gmail Facebook Twitter LinkedIn More