Some Solutions for Peer-to-Peer Global Computing - Archive ouverte HAL Access content directly
Conference Papers Year :

Some Solutions for Peer-to-Peer Global Computing

(1) , (2)
1
2

Abstract

The emergence of Internet and new kind of architecture , like peer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of systems and the world of networking cannot be done as a simple melting of the existing solutions of each side. For example, it is quite obvious that one cannot use synchronized algorithms for global computing over large area network. We propose here a non-exhaustive view of problems one could meet when he aims at building P2P architecture for global computing systems, which u s e asynchronous iterative algorithms. We also propose generic solutions for particular problems linked to both computing and networking sides. These problems involve the initialization of the computation (and its dual the conclusion), the task transparency over P2P network, and the routing in such n e t works. Finally a rst computational experiment is presented for an asynchronous auction algorithm applied to the solution of the shortest path problem.
Fichier principal
Vignette du fichier
JourjonElBaz_ssp2pgc.pdf (186.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01153582 , version 1 (20-05-2015)

Identifiers

  • HAL Id : hal-01153582 , version 1

Cite

Guillaume Jourjon, Didier El Baz. Some Solutions for Peer-to-Peer Global Computing. 13th International Conference on Parallel, Distributed and Network based Processing, Feb 2005, Lugano, Switzerland. pp.49-58. ⟨hal-01153582⟩
217 View
106 Download

Share

Gmail Facebook Twitter LinkedIn More