|
Title:
|
Cooperative scheduling mechanism for large-scale peer-to-peer computing systems
|
|
Author:
|
Rius Torrentó, Josep Maria; Cores Prado, Fernando; Solsona Tehàs, Francesc
|
|
Notes:
|
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.
This work was supported by the MEyC-Spain under contractTIN2011-28689-C02-02 and CSD-2007-00050 and the European Social Fund. The authors are members of the research group 2009SGR145, funded by the Generalitat de Catalunya. |
|
Subject(s):
|
-P2P computing
-Overlays
-Super-peer
-Distributed and centralized scheduling |
|
Rights:
|
(c) Elsevier, 2013
info:eu-repo/semantics/restrictedAccess |
|
Document type:
|
article
publishedVersion |
|
Published by:
|
Elsevier
|
|
Share:
|
|
