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

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

CANON, Louis-Claude
Efficient runtime systems for parallel architectures [RUNTIME]

JEANNOT, Emmanuel
Efficient runtime systems for parallel architectures [RUNTIME]

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

Langue

Rapport

Ce document a été publié dans

2010-10

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

Mots clés en anglais

Volunteer computing systems

collusion

scheduling

result certi- fication

BOINC

Métadonnées

Partager cette publication !

Licence d’utilisation du document

A Scheduling Algorithm for Defeating Collusion

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

Origine

Unités de recherche