The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
A Resource Management Architecture for Metacomputing Systems
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Scalable Approach to Network Enabled Servers (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks
Journal of Parallel and Distributed Computing
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
A peer-to-peer approach to task scheduling in computation grid
International Journal of Grid and Utility Computing
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
CONFIIT: a middleware for peer to peer computing
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
A new method to automatically compute processing times for random walks based distributed algorithms
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
A random walk topology management solution for grid
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
A distributed clustering algorithm for large-scale dynamic networks
Cluster Computing
| Hi-index | 0.00 |
Among all components of a grid or peer-to-peer application, the resources management is unavoidable Indeed, new resources like computational power or storage capacity must be quickly and efficiently integrated This management can be achieved either by a fully centralized way (BOINC) or by a hierarchical way (Globus, DIET) In the latter case, there is a greater flexibility and a greater scalability But the counterpart is the difficulty to design and to deploy such a solution, particularly if the resources are volatile. In this article, we combine random walks and circulating word to derive a fully distributed solution to the resources management Random walks have proved their efficiency in distributed computing and are well suited to dynamical networks like peer-to-peer or grid networks There is no condition on nodes lifetime and we need only one application for each node.