PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Self-stabilization
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
Brief announcement: prefix hash tree
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
DIRAC: A Scalable Lightweight Architecture for High Throughput Computing
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Enabling Flexible Queries with Guarantees in P2P Systems
IEEE Internet Computing
Self-Stabilizing Structured Ring Topology P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Dynamic Prefix Tree for Service Discovery within Large Scale Grids
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed
International Journal of High Performance Computing Applications
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Algorithms (TALG)
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
The forgiving tree: a self-healing distributed data structure
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems
SRDS '08 Proceedings of the 2008 Symposium on Reliable Distributed Systems
Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
International Journal of High Performance Computing Applications
Proceedings of the 28th ACM symposium on Principles of distributed computing
ACM Symposium on Principles of Distributed Computing
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Proceedings of the 28th ACM symposium on Principles of distributed computing
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
A super-peer model for resource discovery services in large-scale Grids
Future Generation Computer Systems
Snap-stabilizing prefix tree for peer-to-peer systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
JEL: unified resource tracking for parallel and distributed applications
Concurrency and Computation: Practice & Experience
DEISA--Distributed European Infrastructure for Supercomputing Applications
Journal of Grid Computing
| Hi-index | 0.00 |
In the days of large scale, heterogeneous computing infrastructures gathering myriads of services, service discovery has become a critical feature that has to deal with the scale and dynamic nature of such platforms. The Spades project (Servicing Petascale Architectures and DistributEd System, 08-ANR-SEGI-025) is a consortium whose purpose is to promote new solutions to deal with a very large number of volatile and heterogeneous computing resources. For the aforementioned reasons, at the project's core, the service discovery has been envisioned as fully decentralized. More precisely, the proposed P2P service discovery system proposed within the Spades project is based on the Dlpt approach (Distributed Lexicographic Placement Table) providing distributed structures and algorithms for such a feature. In this paper, an implementation of the Dlpt concepts into the middleware developed within the Spades project, called Sbam (Spades BAsed Middleware), is devised. Furthermore, its actual deployment over a nation-wide grid system, as well as its performance are detailed.