Achieving Dynamic Workload Balancing for P2P Volunteer Computing

This paper argues that the decentralization feature of Peer-to-Peer (P2P) overlay is more suitable for Volunteer Computing (VC), compared to the centralized master/worker structure in terms of performance bottleneck and single point of failure. Based on the P2P overlay Chord, this paper focused on the design of a workload balancing protocol to coordinate VC. The goal of the protocol was to maximize overall speed-up against the heterogeneity and churn of volunteers. The roles of a facilitator and volunteers (peers) were defined, the key components were designed, including job, result and container. Distributed workload balancing algorithms were proposed to direct the workflow of the key roles for joining and leaving, job search and distribution and result collection. Criteria and metrics were proposed to evaluate the algorithms in regards to the effectiveness against churn and the overall speed-up against number of volunteers. Simulations were devised and completed upon the N-Queen Problem to measure these qualities. Conclusions confirmed that the results were on the right track.

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

[2]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[3]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[4]  V. Kavitha,et al.  Enhancing and Analyzing Search performance in Unstructured Peer to Peer Networks Using Enhanced Guided search protocol (EGSP) , 2010, ArXiv.

[5]  Eric J. Korpela,et al.  SETI@home, BOINC, and Volunteer Distributed Computing , 2012 .

[6]  Juyoung Park,et al.  A Survey on Peer-to-Peer Overlay Network Schemes , 2008, 2008 10th International Conference on Advanced Communication Technology.

[7]  Luis F. G. Sarmenta,et al.  Volunteer Computing , 1996 .

[8]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[9]  Daniel Zappala,et al.  Cluster Computing on the Fly : P 2 P Scheduling of Idle Cycles in the Internet , 2004 .

[10]  Vijay S. Pande,et al.  Folding@home: Lessons from eight years of volunteer distributed computing , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[11]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[12]  Nenghai Yu,et al.  Distributed Hash Table , 2013, SpringerBriefs in Computer Science.

[13]  Feng Yang,et al.  PPVC: A P2P volunteer computing system , 2009, 2009 2nd IEEE International Conference on Computer Science and Information Technology.

[14]  Hao Ning Robust Overlay networks for Volunteer Computing - Decentralized Volunteer Computing Architecture with Fault-tolerance Design , 2010 .

[15]  Luís Veiga,et al.  Large-scale volunteer computing over the Internet , 2012, Journal of Internet Services and Applications.

[16]  Pasquale Cozza,et al.  A P2P Job Assignment Protocol for Volunteer Computing Systems , 2007 .

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

[18]  Rajkumar Buyya,et al.  CycloidGrid: A proximity-aware P2P-based resource discovery architecture in volunteer computing systems , 2013, Future Gener. Comput. Syst..

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

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

[21]  David P. Anderson,et al.  Local Scheduling for Volunteer Computing , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[22]  Ian T. Foster,et al.  Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems , 2002, IPTPS.

[23]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

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