An ant algorithm for balanced job scheduling in grids
Future Generation Computer Systems
Scheduling on the Grid via multi-state resource availability prediction
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Proceedings of the 19th international conference on World wide web
Fast and scalable simulation of volunteer computing systems using SimGrid
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Evaluation of hierarchical desktop grid scheduling algorithms
Future Generation Computer Systems
Concurrency and Computation: Practice & Experience
Balanced Job Scheduling Based on Ant Algorithm for Grid Network
International Journal of Grid and High Performance Computing
Future Generation Computer Systems
A proximity-aware load balancing in peer-to-peer-based volunteer computing systems
The Journal of Supercomputing
Investigating mobile crowdsensing application performance
Proceedings of the third ACM international symposium on Design and analysis of intelligent vehicular networks and applications
Review: Volunteer computing: requirements, challenges, and solutions
Journal of Network and Computer Applications
| Hi-index | 0.00 |
BOINC, a middleware system for volunteer computing, allows hosts to be attached to multiple projects. Each host periodically requests jobs from project servers and executes the jobs. This process involves three interrelated policies: 1) of the runnable jobs on a host, which to execute? 2) when and from what project should a host request more work? 3) what jobs should a server send in response to a given request? 4) How to estimate the remaining runtime of a job? In this paper, we consider several alternatives for each of these policies. Using simulation, we study various combinations of policies, comparing them on the basis of several performance metrics and over a range of parameters such as job length variability, deadline slack, and number of attached projects.