A New Approach to Constructing Volunteer Computing Networks
Peng Zou
Abstract
Peng Zou
Abstract
It is well-known that a well-designed Peer-to-Peer overlay network will gain high scalability and accessibility, but how to construct such a network is still an open problem. This paper proposes a new approach to constructing self-organized volunteer computing overlay networks,and gives a computing task scheduling algorithm based on this network. The simulation results show that our network is scalable and well self-organized and with the characteristics of high clustering efficiency, and is very suitable for large-scale computing task scheduling.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is well-known that a well-designed Peer-to-Peer overlay network will gain high scalability and accessibility, but how to construct such a network is still an open problem. This paper proposes a new approach to constructing self-organized volunteer computing overlay networks,and gives a computing task scheduling algorithm based on this network. The simulation results show that our network is scalable and well self-organized and with the characteristics of high clustering efficiency, and is very suitable for large-scale computing task scheduling.
Key concepts: Computer science, Scalability, Distributed computing, Overlay network, Scheduling (production processes), Overlay, Task (project management), Peer-to-peer