Some Solutions for Peer-to-Peer Global Computing

the emergence of Internet and new kind of architecture, likepeer-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 use 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 networks. Finally a rst computationalexperiment is presented for an asynchronous auction algorithmapplied to the solution of the shortest path ...

• Type: Conference
• Year: 2005
• Where: PDP
• Authors: Guillaume Jourjon, Didier El Baz
• Keywords: Asynchronous Iterative Algorithms, Distributed And Parallel Computing, Global Computing, Global Computing Systems, PDP 2005