Universitat de Lleida
    • English
    • català
    • español
  • English 
    • English
    • català
    • español
  • Login
Repositori Obert UdL
View Item 
  •   Home
  • Recerca
  • Informàtica i Enginyeria Industrial
  • Articles publicats (Informàtica i Enginyeria Industrial)
  • View Item
  •   Home
  • Recerca
  • Informàtica i Enginyeria Industrial
  • Articles publicats (Informàtica i Enginyeria Industrial)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
019259.pdf (2.933Mb)
Sol·licita una còpia
Issue date
2013
Author
Rius Torrentó, Josep Maria
Cores Prado, Fernando
Solsona Tehàs, Francesc
Suggested citation
Rius Torrentó, Josep Maria; Cores Prado, Fernando; Solsona Tehàs, Francesc; . (2013) . Cooperative scheduling mechanism for large-scale peer-to-peer computing systems. Journal of Network and Computer Applications, 2013, vol. 36, núm. 6, p. 1620-1631. https://doi.org/10.1016/j.jnca.2013.01.002.
Impact


Web of Science logo    citations in Web of Science

Scopus logo    citations in Scopus

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
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.
URI
http://hdl.handle.net/10459.1/57268
DOI
https://doi.org/10.1016/j.jnca.2013.01.002
Is part of
Journal of Network and Computer Applications, 2013, vol. 36, núm. 6, p. 1620-1631
European research projects
Collections
  • Articles publicats (Informàtica i Enginyeria Industrial) [932]
  • Publicacions de projectes de recerca del Plan Nacional [2634]
  • Grup de Recerca en Computació Distribuïda (INSPIRES) [57]

Contact Us | Send Feedback | Legal Notice
© 2022 BiD. Universitat de Lleida
Metadata subjected to 
 

 

Browse

All of the repositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

Statistics

View Usage Statistics

D'interès

Política institucional d'accés obertDiposita les teves publicacionsDiposita dades de recercaSuport a la recerca

Contact Us | Send Feedback | Legal Notice
© 2022 BiD. Universitat de Lleida
Metadata subjected to