Emulating Volunteer Computing Scheduling Policies

Authors:
David P. Anderson
Affiliations:
-
Venue:
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Year:
2011

Citing 0
Cited 3

CycloidGrid: A proximity-aware P2P-based resource discovery architecture in volunteer computing systems

Future Generation Computer Systems
A proximity-aware load balancing in peer-to-peer-based volunteer computing systems

The Journal of Supercomputing
Review: Volunteer computing: requirements, challenges, and solutions

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Volunteer computing systems such as BOINC use several interacting scheduling policies, which must address multiple requirements across a large space of usage scenarios. In developing BOINC, we need to design and optimize these policies without direct access to the target nodes (volunteered PCs). To do this, we developed an emulation-based system that predicts the policies' behavior in specific scenarios. This system has been useful in the design and evaluation of policies, in software development, and in the resolution of problems occurring in the field.