|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2006 7th IEEE/ACM International Conference on Grid Computing
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network.
Barcelona
September 28-September 29
ISBN: 1-4244-0343-X
| ASCII Text | x | ||
| J. Celaya, U. Arronategui, "YA: Fast and Scalable Discovery of Idle CPUs in a P2P network.," Grid Computing, IEEE/ACM International Workshop on, pp. 49-55, 2006 7th IEEE/ACM International Conference on Grid Computing, 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ICGRID.2006.310997, author = {J. Celaya and U. Arronategui}, title = {YA: Fast and Scalable Discovery of Idle CPUs in a P2P network.}, journal ={Grid Computing, IEEE/ACM International Workshop on}, volume = {0}, year = {2006}, isbn = {1-4244-0343-X}, pages = {49-55}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICGRID.2006.310997}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Grid Computing, IEEE/ACM International Workshop on TI - YA: Fast and Scalable Discovery of Idle CPUs in a P2P network. SN - 1-4244-0343-X SP49 EP55 A1 - J. Celaya, A1 - U. Arronategui, PY - 2006 KW - dynamic allocation KW - idle CPU KW - P2P network KW - distributed grid system KW - shared grid systems KW - discovery protocol KW - tree-based peer-to-peer network KW - fault-tolerant capabilities KW - locality features VL - 0 JA - Grid Computing, IEEE/ACM International Workshop on ER - | |||
Discovery of large amounts of idle CPUs in fully distributed and shared grid systems is needed in relevant applications and is still a challenging problem. In this paper we present a fast, scalable and efficient discovery protocol founded on a tree-based peer-to-peer (p2p) network with fault-tolerant capabilities and locality features. Each system node stores a good estimation of the number of CPUs that are available in its branch. Each node notifies its father about changes in this value only when it is meaningful enough. This allows low overhead and a stable behavior with concurrent and dynamic allocation of CPUs. This basic mechanism allows any node to launch a discovery process that needs only to follow the information of free CPUs in each branch. Results from experiments and simulation tests, using a simple allocation method, show discovery time scaling logarithmically with the number of nodes
Index Terms:
dynamic allocation, idle CPU, P2P network, distributed grid system, shared grid systems, discovery protocol, tree-based peer-to-peer network, fault-tolerant capabilities, locality features
Citation:
J. Celaya, U. Arronategui, "YA: Fast and Scalable Discovery of Idle CPUs in a P2P network.," grid, pp.49-55, 2006 7th IEEE/ACM International Conference on Grid Computing, 2006
Usage of this product signifies your acceptance of the Terms of Use.