Scheduling in volunteer computing networks, based on neural network prediction of the job execution time

ABSTRACT

Improvement of scheduling which broadly speaking means the distribution of jobs to volunteers is very important for improving the effectiveness of volunteer computing networks operating on the basis of computing resources connected to the Internet. The scheduling strategy based on the prediction of the job execution time is chosen as the main strategy to solve this problem. Suggested approach includes a neural network mechanism for computing the predictive estimate of the job execution time and a genetic algorithm for distributing jobs to volunteers with adjustment of parameters that makes it possible to respond to changes in the computing environment. The features of the approach are illustrated by computing experiments. In addition, we consider an example of the distribution of jobs to two volunteers for a project consisting of three applications. Even approximate (interval) estimates of job execution time allowed reducing the total execution time of the project and thereby optimising the computing process.

KEYWORDS:

• Volunteer computing network
• scheduling
• neural network
• genetic algorithm

Disclosure statement

No potential conflict of interest was reported by the authors.