CANON, Louis-Claude; JEANNOT, Emmanuel; WEISSMAN, Jon

doi:10.1109/IPDPS.2010.5470422

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

CANON, Louis-Claude
Algorithms for the Grid [ALGORILLE]
Efficient runtime systems for parallel architectures [RUNTIME]

JEANNOT, Emmanuel
Algorithms for the Grid [ALGORILLE]
Efficient runtime systems for parallel architectures [RUNTIME]

WEISSMAN, Jon
Department of Computer Science and Engineering [Minneapolis]

Langue

Communication dans un congrès

Ce document a été publié dans

24th IEEE International Parallel and Distributed Processing Symposium - IPDPS 2010, 2010-04-19, Atlanta. 2010p. 1-12

IEEE

Résumé en anglais

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.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

A Dynamic Approach for Characterizing Collusion in Desktop Grids

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche