A P2P Approach for Global Computing

We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some smallworld characteristics such as higher clustering coefficient and short path length, which leads to an efficient heuristic task scheduling algorithm on which any volunteer peer with limited knowledge about the global network can dispatch its excrescent computation tasks to powerful nodes globally, in a way contrary to the current global computing system in which a global broker is responsible for the task scheduling. We argue that our approach is a starting point to eliminate the broker component which makes current global systems unscalable.

• Type: Conference
• Year: 2003
• Where: IPPS
• Authors: Wen Dou, Yan Jia, Huaimin Wang, Wen Qiang Song, Peng Zou
• Keywords: Distributed And Parallel Computing, Global Computing, Global Computing System, IPPS 2003, Task Scheduling