The Effectiveness of Threshold-Based Scheduling Policies in BOINC Projects
Authors:
- 1 December 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 88
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.Keywords
This publication has 22 references indexed in Scilit:
- Predictor@Home: A "Protein Structure Prediction Supercomputer' Based on Global ComputingIEEE Transactions on Parallel and Distributed Systems, 2006
- Metrics for Effective Resource Management in Global Computing Environments2006
- Resource Management for Rapid Application Turnaround on Enterprise Desktop Grids2005
- Self adaptivity in Grid computingConcurrency and Computation: Practice and Experience, 2005
- Automatic methods for predicting machine availability in desktop grid and peer-to-peer systems2004
- Inside discrete-event simulation software: how it works and why it matters2004
- Introduction to simulation2003
- Adaptive computing on the grid using AppLeSIEEE Transactions on Parallel and Distributed Systems, 2003
- Simgrid: a toolkit for the simulation of application scheduling2002
- Master/slave computing on the Grid2002