CycloidGrid: A proximity-aware P2P-based resource discovery architecture in volunteer computing systems

Volunteer computing which benefits from idle cycles of volunteer resources over the Internet can integrate the power of hundreds to thousands of resources to achieve high computing power. In such an environment the resources are heterogeneous in terms of CPU speed, RAM, disk capacity, and network bandwidth. So finding a suitable resource to run a particular job becomes difficult. Resource discovery architecture is a key factor for overall performance of peer-to-peer based volunteer computing systems. The main contribution of this paper is to develop a proximity-aware resource discovery architecture for peer-to-peer based volunteer computing systems. The proposed resource discovery algorithm consists of two stages. In the first stage, it selects resources based on the requested quality of service and current load of peers. In the second stage, a resource with higher priority to communication delay is selected among the discovered resources. Communication delay between two peers is computed by a network model based on queuing theory, taking into account the background traffic of the Internet. Simulation results show that the proposed resource discovery algorithm improves the response time of user's requests by a factor of 4.04 under a moderate load.

[1]  Pam van Schaik,et al.  Today , 2013 .

[2]  Mohammad Hossein Yaghmaee Moghaddam,et al.  Proximity-Aware Resource Discovery Architecture in Peer-to-Peer Based Volunteer Computing System , 2011, 2011 IEEE 11th International Conference on Computer and Information Technology.

[3]  Péter Kacsuk,et al.  Sztaki Desktop Grid: Building a Scalable, Secure Platform for Desktop Grid Computing , 2007, CoreGRID Workshop - Making Grids Work.

[4]  Alexandru Iosup,et al.  The performance of bags-of-tasks in large-scale distributed systems , 2008, HPDC '08.

[5]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[6]  Miron Livny,et al.  A worldwide flock of Condors: Load sharing among workstation clusters , 1996, Future Gener. Comput. Syst..

[7]  Gábor Terstyánszky,et al.  EDGeS: A Bridge between Desktop Grids and Service Grids , 2008, The Third ChinaGrid Annual Conference (chinagrid 2008).

[8]  Mohamed Jemni,et al.  A decentralized and fault‐tolerant Desktop Grid system for distributed applications , 2010, Concurr. Comput. Pract. Exp..

[9]  Prashant Malik,et al.  Cassandra: a decentralized structured storage system , 2010, OPSR.

[10]  Cosimo Anglano,et al.  The ShareGrid Peer-to-Peer Desktop Grid: Infrastructure, Applications, and Performance Evaluation , 2010, Journal of Grid Computing.

[11]  Paul Guinnessy Paul Guinnessy,et al.  Nuclear Industry Creates World University , 2003 .

[12]  SangKeun Lee,et al.  Self-Gridron: Reliable, Autonomous, and Fully Decentralized Desktop Grid Computing System based on Neural Overlay Network , 2008, PDPTA.

[13]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[14]  Horst Rinne,et al.  The Weibull Distribution: A Handbook , 2008 .

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

[16]  Dennis Schwerdel,et al.  A Self-Organizing Super-Peer Overlay with a Chord Core for Desktop Grids , 2008, IWSOS.

[17]  Guihai Chen,et al.  Cycloid: a constant-degree and lookup-efficient P2P overlay network , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[18]  Y. Charlie Hu,et al.  A Self-Organizing Flock of Condors , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[19]  Rajkumar Buyya,et al.  Aneka: Next-Generation Enterprise Grid Platform for e-Science and e-Business Applications , 2007, Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007).

[20]  Fabio Kon,et al.  Design and Implementation of a Middleware for Data Storage in Opportunistic Grids , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[21]  Keith W. Ross,et al.  The Index Poisoning Attack in P2P File Sharing Systems , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  Joan Manuel Marquès,et al.  Flexible Resource Discovery for Decentralized P2P and Volunteer Computing Systems , 2010, 2010 19th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises.

[23]  Koen Bertels,et al.  Hybrid Resource Discovery Mechanism in Ad Hoc Grid Using Structured Overlay , 2009, ARCS.

[24]  Derrick Kondo,et al.  A maximum independent set approach for collusion detection in voting pools , 2011, J. Parallel Distributed Comput..

[25]  Mohamed Jemni,et al.  Controlling processing usage at user level: a way to make resource sharing more flexible , 2010 .

[26]  Ian J. Taylor,et al.  Attic: A Case Study for Distributing Data in BOINC Projects , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[27]  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).

[28]  Carey L. Williamson,et al.  A comparative analysis of web and peer-to-peer traffic , 2008, WWW.

[29]  David P. Anderson.  Emulating Volunteer Computing Scheduling Policies , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[30]  Krzysztof Walkowiak,et al.  A P2P computing system for overlay networks , 2013, Future Gener. Comput. Syst..

[31]  Bobby Bhattacharjee,et al.  Trade-offs in matching jobs and balancing load for distributed desktop grids , 2008, Future Gener. Comput. Syst..

[32]  Mohammad Kazem Akbari,et al.  A comprehensive analytical model of interconnection networks in large‐scale cluster systems , 2008, Concurr. Comput. Pract. Exp..

[33]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[34]  Luis F. G. Sarmenta,et al.  Sabotage-tolerance mechanisms for volunteer computing systems , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

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

[36]  Xin Guo,et al.  Optimal probabilistic routing in distributed parallel queues , 2004, PERV.

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

[38]  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..

[39]  Stefano Ferretti,et al.  Gossiping for resource discovering: An analysis based on complex network theory , 2013, Future Gener. Comput. Syst..

[40]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[41]  Hermes Senger,et al.  Scalability limits of Bag-of-Tasks applications running on hierarchical platforms , 2011, J. Parallel Distributed Comput..

[42]  Mohamed Jemni,et al.  BonjourGrid: Orchestration of multi-instances of grid middlewares on institutional Desktop Grids , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[43]  Andrew A. Chien,et al.  Entropia: architecture and performance of an enterprise desktop grid system , 2003, J. Parallel Distributed Comput..

[44]  Alexander Mendiburu,et al.  High throughput computing over peer-to-peer networks , 2013, Future Gener. Comput. Syst..

[45]  Nazareno Andrade,et al.  Labs of the World, Unite!!! , 2006, Journal of Grid Computing.

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

[47]  Denis Trystram,et al.  On the Scheduling of Checkpoints in Desktop Grids , 2011, 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing.

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

[49]  Dexter H. Hu,et al.  Gossip-based Dynamic Load Balancing in a Self-organized Desktop Grid , 2009 .

[50]  Luis F. G. Sarmenta.  Sabotage-tolerance mechanisms for volunteer computing systems , 2002, Future Gener. Comput. Syst..

[51]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[52]  James F. Robeson,et al.  The Distribution Handbook , 1984 .

[53]  Domenico Talia,et al.  A scalable super-peer approach for public scientific computation , 2009, Future Gener. Comput. Syst..

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