Balancing Scientist Needs and Volunteer Preferences in Volunteer Computing Using Constraint Optimization

Authors:
James Atlas;Trilce Estrada;Keith Decker;Michela Taufer
Affiliations:
University of Delaware, Newark, U.S.A. DE 19716;University of Delaware, Newark, U.S.A. DE 19716;University of Delaware, Newark, U.S.A. DE 19716;University of Delaware, Newark, U.S.A. DE 19716
Venue:
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Year:
2009

Citing 6
Cited 1

A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
An analysis and application of distributed constraint satisfaction and optimization algorithms in sensor networks

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
BOINC: A System for Public-Resource Computing and Storage

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Homogeneous Redundancy: a Technique to Ensure Integrity of Molecular Simulation Results Using Public Computing

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Celebrating Diversity in Volunteer Computing

HICSS '09 Proceedings of the 42nd Hawaii International Conference on System Sciences
EmBOINC: An emulator for performance analysis of BOINC projects

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing

Review: Volunteer computing: requirements, challenges, and solutions

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

BOINC is a middleware for Volunteer Computing. In BOINC projects, heterogeneous resources distributed across the Internet are used for large-scale scientific simulations. The large need for resources in BOINC projects often competes with volunteer preferences: volunteers can impose limits on the use of their idle resources. Most of the time, maximum project performance can be achieved only when volunteer preferences are neglected. To address this problem, we propose a novel optimization procedure based on constraint optimization techniques that actively allocates volunteer resources to improve project throughput and, at the same time, aims to preserve volunteer preferences. We show the increase in project throughput obtained with our approach and discuss the trade-off between volunteer preferences and project throughput.