The Effectiveness of Threshold-Based Scheduling Policies in BOINC Projects

Authors:
Trilce Estrada;David A. Flores;Michela Taufer;Patricia J. Teller;Andre Kerstens;David P. Anderson
Affiliations:
University of Texas at El Paso, USA;University of Texas at El Paso, USA;University of Texas at El Paso, USA;University of Texas at El Paso, USA;University of Texas at El Paso, USA;University of California at Berkeley, USA
Venue:
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
Year:
2006

Citing 0
Cited 8

SimBA: A Discrete Event Simulator for Performance Prediction of Volunteer Computing Projects

Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
A distributed evolutionary method to design scheduling policies for volunteer computing

Proceedings of the 5th conference on Computing frontiers
A distributed evolutionary method to design scheduling policies for volunteer computing

ACM SIGMETRICS Performance Evaluation Review
Modeling Job Lifespan Delays in Volunteer Computing Projects

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
On correlated availability in Internet-distributed systems

GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Fast and scalable simulation of volunteer computing systems using SimGrid

Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
High-throughput virtual molecular docking: Hadoop implementation of AutoDock4 on a private cloud

Proceedings of the second international workshop on Emerging computational methods for the life sciences
Review: Volunteer computing: requirements, challenges, and solutions

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.