Decentralizing Volunteer Computing Coordination

This paper attempted to decentralize volunteer computing (VC) coordination with the goal of reducing the reliance on a central coordination server, which had been criticized for performance bottleneck and single point of failure. On analyzing the roles and functions that the VC components played for the centralized master/worker coordination model, this paper proposed a decentralized VC coordination framework based on distributed hash table (DHT) and peer-to-peer (P2P) overlay and then successfully mapped the centralized VC coordination into distributed VC coordination. The proposed framework has been implemented on the performance-proven DHT P2P overlay Chord. The initial verification has demonstrated the effectiveness of the framework when working in distributed environments.

[1]  Vrinda Tokekar,et al.  Identification of efficient peers in P2P computing system for real time applications , 2012, ArXiv.

[2]  Mohamed Ben Belgacem,et al.  Virtual EZ Grid: A Volunteer Computing Infrastructure for Scientific Medical Applications , 2010, Int. J. Handheld Comput. Res..

[3]  Karsten Loesing,et al.  Open Chord version 1.0.4 User's Manual , 2007 .

[4]  Franck Cappello,et al.  Cost-benefit analysis of Cloud Computing versus desktop grids , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[5]  Peter Druschel,et al.  Peer-to-peer systems , 2010, Commun. ACM.

[6]  Huaimin Wang,et al.  A P2P approach for global computing , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[7]  David P. Anderson,et al.  High-performance task distribution for volunteer computing , 2005, First International Conference on e-Science and Grid Computing (e-Science'05).

[8]  E. J. Hoffman,et al.  Constructions for the Solution of the m Queens Problem , 1969 .

[9]  Aaron Harwood,et al.  P2P-Tuple: Towards a Robust Volunteer Computing Platform , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.

[10]  David P. Anderson,et al.  SETI@home: an experiment in public-resource computing , 2002, CACM.

[11]  Michael Dahlin,et al.  Volunteer Cloud Computing: MapReduce over the Internet , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[12]  Thomas Hérault,et al.  Computing on large-scale distributed systems: XtremWeb architecture, programming models, security, tests and convergence with grid , 2005, Future Gener. Comput. Syst..

[13]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[14]  Rajkumar Buyya,et al.  A proximity-aware load balancing in peer-to-peer-based volunteer computing systems , 2012, The Journal of Supercomputing.

[15]  David P. Anderson,et al.  Exploiting non-dedicated resources for cloud computing , 2010, 2010 IEEE Network Operations and Management Symposium - NOMS 2010.

[16]  David P. Anderson,et al.  Performance Evaluation of Scheduling Policies for Volunteer Computing , 2007, Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007).

[17]  David A. Kramer,et al.  Utilization of a local grid of Mac OS X-based computers using Xgrid , 2004, Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004..

[18]  Oisín Curran,et al.  A workflow model for heterogeneous computing environments , 2009, Future Gener. Comput. Syst..