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.
Type de document :
[Research Report] RR-7403, INRIA. 2010
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

Contributeur : Emmanuel Jeannot <>
Soumis le : vendredi 8 octobre 2010 - 08:53:07
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12
Document(s) archivé(s) le : jeudi 25 octobre 2012 - 16:40:36


Fichiers produits par l'(les) auteur(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〉



Consultations de la notice


Téléchargements de fichiers