@techreport{RR-RAMSES-6139,
        Title = {Cosmological Simulations using Grid Middleware},
        Author = {Caniou, Yves and Caron, Eddy and Depardon, Benjamin and  
Courtois, H{\'e}l{\`e}ne and Teyssier, Romain},
        Institution = {Institut National de Recherche en Informatique et en  
Automatique (INRIA)},
        Keywords = {Grid computing, cosmological simulations, DIET, LEGO},
        Month = march,
        Note = {Also available as LIP Research Report 2007-11},
        Number = {6139},
        Url = {http://hal.inria.fr/inria-00135189},
        Year = 2007,
        Abstract = {Within computational grids, some services (software  
components, linear algebra libraries, etc.) are made available by  
some servers to some clients. In spite of the growing popularity of  
such grids, the service discovery, although efficient in many cases,  
does not reach several requirements. Among them, the flexibility of  
the discovery and its efficiency on wide-area dynamic platforms are  
two major issues. Therefore, it becomes crucial to propose new tools  
coping with such platforms. Emerging peer-to-peer technologies  
provide algorithms allowing the distribution and the retrieval of  
data items while addressing the dynamicity of the underlying network.  
We study in this paper the service discovery in a pure peer-to-peer  
environment. We describe a new trie-based approach for the service  
discovery that supports range queries and automatic completion of  
partial search strings, while providing fault-tolerance, and  
partially taking into account the topology of the underlying network.  
We validate this approach both by analysis and simulation.  
Traditional metrics considered in peer-to-peer systems exhibits  
interesting complexities within our architecture. The analysis'  
results are confirmed by some simulation experiments run using  
several grid's data sets.}
}

@techreport{RR-RAMSES-2007-11,
        Title = {Cosmological Simulations using Grid Middleware},
        Author = {Caniou, Yves and Caron, Eddy and Depardon, Benjamin and  
Courtois, H{\'e}l{\`e}ne and Teyssier, Romain},
        Institution = {Laboratoire de l'Informatique du Parall{\'e}lisme  
(LIP)},
        Keywords = {Grid computing, cosmological simulations, DIET, LEGO},
        Month = march,
        Note = {Also available as INRIA Research Report 6139},
        Number = {RR2007-11},
        Pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2007/ 
RR2007-11.pdf},
        Year = 2007,
        Abstract = {Within computational grids, some services (software  
components, linear algebra libraries, etc.) are made available by  
some servers to some clients. In spite of the growing popularity of  
such grids, the service discovery, although efficient in many cases,  
does not reach several requirements. Among them, the flexibility of  
the discovery and its efficiency on wide-area dynamic platforms are  
two major issues. Therefore, it becomes crucial to propose new tools  
coping with such platforms. Emerging peer-to-peer technologies  
provide algorithms allowing the distribution and the retrieval of  
data items while addressing the dynamicity of the underlying network.  
We study in this paper the service discovery in a pure peer-to-peer  
environment. We describe a new trie-based approach for the service  
discovery that supports range queries and automatic completion of  
partial search strings, while providing fault-tolerance, and  
partially taking into account the topology of the underlying network.  
We validate this approach both by analysis and simulation.  
Traditional metrics considered in peer-to-peer systems exhibits  
interesting complexities within our architecture. The analysis'  
results are confirmed by some simulation experiments run using  
several grid's data sets.}
}