YA: Fast and Scalable Discovery of Idle CPUs in a P2P network.

Authors:
Javier Celaya;Unai Arronategui
Affiliations:
Department of Computer Science and Systems Engineering, University of Zaragoza, C/ Mar?de Luna 1, Ed. Ada Byron, 50018 Zaragoza, Spain. jcelaya@unizar.es;Department of Computer Science and Systems Engineering, University of Zaragoza, C/ Mar?de Luna 1, Ed. Ada Byron, 50018 Zaragoza, Spain. unai@unizar.es
Venue:
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Year:
2006

Citing 14
Cited 1

SETI@home: an experiment in public-resource computing

Communications of the ACM
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
Querying peer-to-peer networks using P-trees

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
BOINC: A System for Public-Resource Computing and Storage

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Computing on large-scale distributed systems: Xtrem Web architecture, programming models, security, tests and convergence with grid

Future Generation Computer Systems - Special issue: P2P computing and interaction with grids
G2-P2P: a fully decentralised fault-tolerant cycle-stealing framework

ACSW Frontiers '05 Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44
BATON: a balanced tree structure for peer-to-peer networks

VLDB '05 Proceedings of the 31st international conference on Very large data bases
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Unstructured peer-to-peer networks for sharing processor cycles

Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
Geographic locality of IP prefixes

IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Peer-to-Peer Discovery of Computational Resources for Grid Applications

GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Java, peer-to-peer, and accountability: building blocks for distributed cycle sharing

VM'04 Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3

A Fair Decentralized Scheduler for Bag-of-Tasks Applications on Desktop Grids

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.