loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Parallel and Distributed Processing Symposium (IPDPS'03)
A P2P Approach for Global Computing
Nice, France
April 22-April 26
ISBN: 0-7695-1926-1
Wen Dou, Changsha Institute of Technology
Yan Jia, Changsha Institute of Technology
Huai Ming Wang, Changsha Institute of Technology
Wen Qiang Song, 3 rd Military Medical University
Peng Zou, Changsha Institute of Technology
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 small-world 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.
Citation:
Wen Dou, Yan Jia, Huai Ming Wang, Wen Qiang Song, Peng Zou, "A P2P Approach for Global Computing," ipdps, pp.248b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.