Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
PREPRINT DRAFT --Submitted for publication 2007 PREPRINTDRAFT--Submittedforpublication,PChan&DAbramson2007 PREPRINT DRAFT --Submitted for publication 2007
 

Summary: PREPRINT DRAFT -- Submitted for publication 2007
PREPRINTDRAFT--Submittedforpublication,PChan&DAbramson2007 PREPRINT DRAFT -- Submitted for publication 2007
A Scalable and Efficient Prefix-based Lookup Mechanism for
Large-Scale Grids
Philip Chan David Abramson
e-Science and Grid Engineering Laboratory (MESSAGELab)
Monash University
900 Dandenong Road, Caulfield East, VIC 3145, Australia
{pchan,davida}@csse.monash.edu.au
Abstract
Data sources, storage, computing resources and ser-
vices are entities on Grids that require mechanisms for
publication and lookup. A discovery service relies on
efficient lookup to locate these objects from names or
attributes. And on large-scale grids, these should be
scalable and be able to support range queries and multi-
criteria searching. Trie-based approaches like the PHT
and DPT, enable sophisticated queries while providing
resilience to failures. In this paper, we propose a more
efficient variant of the DPT called the Dynamic Prefix

  

Source: Abramson, David - Caulfield School of Information Technology, Monash University

 

Collections: Computer Technologies and Information Sciences