2004Computer Engineering and ScienceRequires access

A New Approach to Constructing Volunteer Computing Networks

Peng Zou

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Scalability, Distributed computing, Overlay network, Scheduling (production processes), Overlay, Task (project management), Peer-to-peer

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Approach to Constructing Volunteer Computing Networks — Research Paper | ScholarLens