Task scheduling in distributed volunteer computing systems

With the increase in the amount of data processing the importance of distributed computational systems is rising. The efficiency of the task scheduling algorithms used in distributed computational systems is one of the major challenges for the architecture of such systems. This paper presents and introduces a new task scheduling algorithm suggested for volunteer computing systems. It is based on an assessment of host performance, which is obtained from the characteristics of hosts participating in BOINC., the most widely used representative of volunteer computing systems. This paper also describes the simulation process and the achieved results of the proposed algorithm as compared with the original FCFS BOINC scheduling strategy.