loading...
The Effectiveness of Threshold-Based Scheduling Policies in BOINC Projects
Amsterdam, Netherlands December 04-December 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/E-SCIENCE.2006.137Second IEEE International Conference ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Trilce Estrada, University of Texas at El Paso, USA
David A. Flores, University of Texas at El Paso, USA
Michela Taufer, University of Texas at El Paso, USA
Patricia J. Teller, University of Texas at El Paso, USA
Andre Kerstens, University of Texas at El Paso, USA
David P. Anderson, University of California at Berkeley, USA
Several scientific projects use BOINC (Berkeley Open Infrastructure for Network Computing) to perform largescale simulations using volunteers? computers (workers) across the Internet. In general, the scheduling of tasks in BOINC uses a First-Come-First-Serve policy and no attention is paid to workers? past performance, such as whether or not they have tended to perform tasks promptly and correctly.

In this paper we use SimBA, a discrete-event Simulator of BOINC Applications, to study new threshold-based scheduling strategies for BOINC projects that use availability and reliability metrics to classify workers and distribute tasks according to this classification. We show that if availability and reliability thresholds are selected properly, then the workers? throughput of valid results increases significantly in BOINC projects.

Citation:
Trilce Estrada, David A. Flores, Michela Taufer, Patricia J. Teller, Andre Kerstens, David P. Anderson, "The Effectiveness of Threshold-Based Scheduling Policies in BOINC Projects," e-science, pp.88, Second IEEE International Conference on e-Science and Grid Computing (e-Science'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.