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

  • Authors:

  • Josep Rius;Fernando Cores;Francesc Solsona

  • Affiliations:

  • Department of Computer Science and Industrial Engineering, University of Lleida, C/Jaume II 69, E-25001 Lleida, Spain;Department of Computer Science and Industrial Engineering, University of Lleida, C/Jaume II 69, E-25001 Lleida, Spain;Department of Computer Science and Industrial Engineering, University of Lleida, C/Jaume II 69, E-25001 Lleida, Spain

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.