Cooperative scheduling mechanism for large-scale peer-to-peer computing systems

Over recent years, peer-to-peer (P2P) systems have become an important part of Internet. Millions of users have been attracted to their structures and services. P2P computing is a distributed computing paradigm that uses Internet to connect thousands, or even millions, of users into a single large virtual computer based on the sharing of computational resources. One of the most critical aspects to the design of P2P computing systems is the development of scheduling techniques to manage the computational resources efficiently and in a scalable way. This paper proposes a cooperative scheduling mechanism with a two-level topology designed to work on large-scale distributed computing P2P systems. Our main contribution is proposing three criteria that only use local information to schedule tasks thus providing scalability to the overall scheduling system. By setting up these three criteria, the system can be easily adapted to work efficiently with very different kinds of distributed applications. The extensive experimentation carried out justifies the importance of good scheduling in such heterogeneous systems, but also emphasizes the importance of having a scheduling algorithm capable of being adapted to the requirements of different kinds of application.

[1]  Fernando Cores,et al.  A New Credit-Based Incentive Mechanism for P2P Scheduling with User Modeling , 2009, 2009 First International Conference on Advances in P2P Systems.

[2]  Loris Marchal,et al.  A Fair Decentralized Scheduler for Bag-of-Tasks Applications on Desktop Grids , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[3]  Douglas G. Down,et al.  Dynamic scheduling for heterogeneous Desktop Grids , 2008, Grid 2008.

[4]  Ian T. Foster,et al.  On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing , 2003, IPTPS.

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

[6]  Chih-Lin Hu,et al.  A hierarchical overlay with cluster-based reputation tree for dynamic peer-to-peer systems , 2012, J. Netw. Comput. Appl..

[7]  Francesc Giné,et al.  Combining Hilbert SFC and Bruijn Graphs for Searching Computing Markets in a P2P System , 2010, Euro-Par.

[8]  Srinivas Aluru,et al.  PARALLEL-TCOFFEE: A parallel multiple sequence aligner , 2007, PDCS.

[9]  Li Zhang,et al.  Tycoon: An implementation of a distributed, market-based resource allocation system , 2004, Multiagent Grid Syst..

[10]  Nazareno Andrade,et al.  Automatic grid assembly by promoting collaboration in peer-to-peer grids , 2007, J. Parallel Distributed Comput..

[11]  Satish K. Tripathi,et al.  Parallel and distributed simulation of discrete event systems , 1994 .

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

[13]  D. Higgins,et al.  T-Coffee: A novel method for fast and accurate multiple sequence alignment. , 2000, Journal of molecular biology.

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

[15]  David E. Irwin,et al.  Sharing Networked Resources with Brokered Leases , 2006, USENIX Annual Technical Conference, General Track.

[16]  Zhan Zhang,et al.  MARCH: A Distributed Incentive Scheme for Peer-to-Peer Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[17]  Gilles Fedak,et al.  Extending the EGEE Grid with XtremWeb-HEP Desktop Grids , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[18]  P. Oscar Boykin,et al.  Balanced Overlay Networks (BON): An Overlay Technology for Decentralized Load Balancing , 2004, IEEE Transactions on Parallel and Distributed Systems.

[19]  Francisco Vilar Brasileiro,et al.  Running Bag-of-Tasks applications on computational grids: the MyGrid approach , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..

[20]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[21]  L. Holm,et al.  The Pfam protein families database , 2005, Nucleic Acids Res..

[22]  Mario Lauria,et al.  Self-Organizing Scheduling on the Organic Grid , 2006, Int. J. High Perform. Comput. Appl..

[23]  Seif Haridi,et al.  An Overview of Structured P2P Overlay Networks , 2005, Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks.

[24]  Bharadwaj Veeravalli,et al.  Design of Fast and Efficient Energy-Aware Gradient-Based Scheduling Algorithms Heterogeneous Embedded Multiprocessor Systems , 2009, IEEE Transactions on Parallel and Distributed Systems.

[25]  D. Milojicic,et al.  Peer-to-Peer Computing , 2010 .

[26]  Francisco Vilar Brasileiro,et al.  Scheduling CPU-Intensive Grid Applications Using Partial Information , 2008, 2008 37th International Conference on Parallel Processing.

[27]  Larry Carter,et al.  Centralized versus Distributed Schedulers for Bag-of-Tasks Applications , 2008, IEEE Transactions on Parallel and Distributed Systems.

[28]  Francesc Giné,et al.  A Computing Resource Discovery Mechanism over a P2P Tree Topology , 2010, VECPAR.

[29]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[30]  Robert D. Finn,et al.  The Pfam protein families database , 2004, Nucleic Acids Res..

[31]  Pragyansmita Paul.  SETI @ home project and its website , 2002, CROS.

[32]  Li Zhao,et al.  Improving cooperation in peer-to-peer systems using social networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.