1. Gabriel Antoniu, Hinde Lilia Bouziane, Mathieu Jan, Christian Pérez, and Thierry Priol. Combining data sharing with the master-worker paradigm in the common component architecture. Cluster Computing, 10(3):265 -- 276, 2007.
   Keywords: Component, Data sharing, Master-worker, Grid computing, LEGO.
   

   @Article{ articleantoniu.abjpp_cc07,
   author = {Antoniu, Gabriel and Bouziane, Hinde Lilia and Jan, Mathieu and P{\'e}rez, Christian and Priol, Thierry},
   title = {Combining data sharing with the master-worker paradigm in the common component architecture},
   year = {2007},
   journal = {Cluster Computing},
   volume = {10},
   number = {3},
   pages = {265 -- 276 },
   publisher = {Kluwer Academic Publishers Hingham, MA, USA},
   keywords = {Component, Data sharing, Master-worker, Grid computing, LEGO} 
   }
   




2. Olivier Aumage, Elisabeth Brunet, and Raymond Namyst. NewMadeleine : ordonnancement et optimisation de schémas de communication haute performance (version étendue de Perpi'06).. Technique et Science Informatiques, 2007.
   Note: Submitted.
   Keywords: Madeleine, LEGO.
   

   @Article{ articleaumage.abn_tsi07,
   author = {Olivier Aumage and Elisabeth Brunet and Raymond Namyst},
   journal = {Technique et Science Informatiques},
   title = {NewMadeleine : ordonnancement et optimisation de schémas de communication haute performance (version étendue de Perpi'06).},
   year = {2007},
   note = {Submitted},
   keywords = {Madeleine,LEGO} 
   }
   




3. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. Enhancing Computational Grids with Peer-to-Peer technology for Large Scale Service Discovery. Journal of Grid Computing, 5(3):337-360, September 2007.
   Keywords: DLPT, LEGO.

   Abstract:

   Within computational Grids, some services (typically software components, e.g., linear algebra libraries) 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. Whereas merging peer-to-peer technology and Grid infrastructures has been widely suggested, very few implementations are available. The contribution of this paper is twofold. First, we present the design, the implementation and the experimentation of the first architecture, to our knowledge, extending traditional Network-Enabled Servers (NES) systems with an unstructured peer-to-peer network. This extension allows to dynamically connect distributed agents thus providing to clients an entry point to servers geographically distributed. Our implementation is based on the Diet middleware and the JXTA toolbox and experimentation have been conducted on a high speed network. Then, we study the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the peer-to-peer service discovery service, supporting range queries while providing fault-tolerance and taking into account the topology of the underlying network. We validate this approach both by analysis and simulation.

   
   

   @Article{ articlecaron.cdt_jgc07,
   abstract = {Within computational Grids, some services (typically software components, e.g., linear algebra libraries) 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. Whereas merging peer-to-peer technology and Grid infrastructures has been widely suggested, very few implementations are available. The contribution of this paper is twofold. First, we present the design, the implementation and the experimentation of the first architecture, to our knowledge, extending traditional Network-Enabled Servers (NES) systems with an unstructured peer-to-peer network. This extension allows to dynamically connect distributed agents thus providing to clients an entry point to servers geographically distributed. Our implementation is based on the Diet middleware and the JXTA toolbox and experimentation have been conducted on a high speed network. Then, we study the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the peer-to-peer service discovery service, supporting range queries while providing fault-tolerance and taking into account the topology of the underlying network. We validate this approach both by analysis and simulation.},
   author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
   editor = {Springer Netherlands},
   journal = {Journal of Grid Computing},
   keywords = {DLPT, LEGO},
   month = sep,
   number = {3},
   pages = {337-360},
   title = {Enhancing Computational Grids with Peer-to-Peer technology for Large Scale Service Discovery},
   url = {http://www.springerlink.com/content/946324035g533050/fulltext.pdf},
   volume = {5},
   year = {2007} 
   }
   




4. Alexandre DENIS. Meta-communications in component-based communication frameworks for grids. Cluster Computing, (DOI 10.1007/s10586-007-0036-5), 2007.
   Note: To appear.
   Keywords: LEGO.
   

   @Article{ articledenis.d_cc07,
   author = {Alexandre DENIS},
   journal = {Cluster Computing},
   title = {Meta-communications in component-based communication frameworks for grids},
   year = {2007},
   note = {To appear},
   number = {DOI 10.1007/s10586-007-0036-5},
   keywords = {LEGO} 
   }
   




5. R. B. Tully, E. J. Shaya, I. D. Karachentsev, H. Courtois, D. D. Kocevski, L. Rizzi, and A. Peel. Our Peculiar Motion Away from the Local Void. ArXiv e-prints, 705, May 2007.
   Note: Provided by the Smithsonian/NASA Astrophysics Data System.
   Keywords: LEGO.
   

   @Article{ articletully.tskckrp_ae07,
   author = {{Tully}, R.~B. and {Shaya}, E.~J. and {Karachentsev}, I.~D. and {Courtois}, H. and {Kocevski}, D.~D. and {Rizzi}, L. and {Peel}, A. },
   title = "{Our Peculiar Motion Away from the Local Void}",
   journal = {ArXiv e-prints},
   year = 2007,
   month = may,
   volume = 705,
   url = {http://adsabs.harvard.edu/abs/2007arXiv0705.4139T},
   note = {Provided by the Smithsonian/NASA Astrophysics Data System},
   keywords = {LEGO} 
   }
   

1. Gabriel Antoniu, Eddy Caron, Frédéric Desprez, Aurélia Fèvre, and Mathieu Jan. Towards a Transparent Data Access Model for the GridRPC Paradigm. In Proc. of the 13th Internationl Conference on High Performance Computing (HiPC 2007), volume 4873 of Lect. Notes in Comp. Science, Goa, India, pages 269-284, December 2007. Springer-Verlag.
   Keywords: LEGO, JUXMEM, TLSE, DIET, GRIDRPC.
   

   @InProceedings{ inproceedingsantoniu.acdfj_07*1,
   author = {Antoniu, Gabriel and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and F{\`e}vre, Aur{\'e}lia and Jan, Mathieu},
   title = {Towards a Transparent Data Access Model for the GridRPC Paradigm},
   year = {2007},
   month = {December},
   booktitle = {Proc. of the 13th Internationl Conference on High Performance Computing (HiPC 2007)},
   volume = {4873},
   pages = {269-284},
   series = {Lect. Notes in Comp. Science},
   address = {Goa, India},
   publisher = {Springer-Verlag},
   keywords = {LEGO, JUXMEM, TLSE, DIET, GRIDRPC} 
   }
   




2. Gabriel Antoniu, Eddy Caron, Frédéric Desprez, Aurélia Fèvre, and Mathieu Jan. Towards a Transparent Data Access Model for the GridRPC Paradigm. In S. Aluru et al. (Eds), editor, HiPC'2007. 14th International Conference on High Performance Computing., number 4873 of LNCS, Goa. India, pages 269-284, December 2007. Springer Verlag Berlin Heidelberg.
   Keywords: DIET, JuxMem, LEGO.
   

   @InProceedings{ inproceedingsantoniu.acdfj_07,
   address = {Goa. India},
   author = {Antoniu, Gabriel and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and F{\`e}vre, Aur{\'e}lia and Jan, Mathieu},
   booktitle = {{HiPC'2007}. 14th International Conference on High Performance Computing.},
   editor = {S. Aluru et al. (Eds)},
   keywords = {DIET, JuxMem, LEGO},
   month = dec,
   number = {4873},
   pages = {269-284},
   publisher = {Springer Verlag Berlin Heidelberg},
   series = {LNCS},
   title = {Towards a Transparent Data Access Model for the GridRPC Paradigm},
   year = {2007} 
   }
   




3. Gabriel Antoniu, Loïc Cudennec, Mike Duigou, and Mathieu Jan. Performance scalability of the JXTA P2P framework. In Proc. 21st IEEE International Parallel & Distributed Processing Symposium (IPDPS 2007), Long Beach, CA, USA, pages 108, March 2007.
   Keywords: ADAGE, JXTA, P2P, LEGO.
   

   @InProceedings{ inproceedingsantoniu.acdj_07,
   author = {Antoniu, Gabriel and Cudennec, Lo{\"i}c and Duigou, Mike and Jan, Mathieu},
   title = {Performance scalability of the {JXTA P2P} framework},
   year = {2007},
   month = {March},
   booktitle = {Proc. 21st IEEE International Parallel & Distributed Processing Symposium (IPDPS 2007)},
   pages = {108},
   address = {Long Beach, CA, USA},
   url = {http://hal.inria.fr/inria-00119916/en},
   keywords = {ADAGE, JXTA, P2P, LEGO} 
   }
   




4. Hrachya Astsatryan, Michel Daydé, Aurélie Hurault, Marc Pantel, and Eddy Caron. On defining a Web Interface for Linear Algebra Tasks over Computational Grids. In International Conference on Computer Science and Information Technologies (CSIT'07), Yerevan (Arménie), September 2007.
   Keywords: LEGO.
   

   @InProceedings{ inproceedingsastsatryan.adhpc_07,
   address = {Yerevan (Arm{\'e}nie)},
   author = {Astsatryan, Hrachya and Dayd{\'e}, Michel and Hurault, Aur{\'e}lie and Pantel, Marc and Caron, Eddy},
   booktitle = {International Conference on Computer Science and Information Technologies (CSIT'07)},
   keywords = {LEGO},
   month = sep,
   title = {On defining a Web Interface for Linear Algebra Tasks over Computational Grids},
   year = {2007} 
   }
   




5. Olivier Aumage, Elisabeth Brunet, Nathalie Furmento, and Raymond Namyst. NewMadeleine: a Fast Communication Scheduling Engine for High Performance Networks. In CAC 2007: Workshop on Communication Architecture for Clusters, held in conjunction with IPDPS 2007, Long Beach, California, USA, March 2007.
   Note: Also available as LaBRI Report 1421-07 and INRIA RR-6085.
   Keywords: MadMPI, Madeleine, MPI, LEGO.
   

   @InProceedings{ inproceedingsaumage.abfn_07,
   author = {Olivier Aumage and Elisabeth Brunet and Nathalie Furmento and Raymond Namyst},
   booktitle = {CAC 2007: Workshop on Communication Architecture for Clusters, held in conjunction with IPDPS 2007},
   title = {NewMadeleine: a Fast Communication Scheduling Engine for High Performance Networks},
   year = {2007},
   address = {Long Beach, California, USA},
   month = {March},
   note = {Also available as LaBRI Report 1421-07 and INRIA RR-6085},
   keywords = {MadMPI, Madeleine, MPI, LEGO} 
   }
   




6. Olivier Aumage, Elisabeth Brunet, Guillaume Mercier, and Raymond Namyst. High-Performance Multi-Rail Support with the NewMadeleine Communication Library. In HCW 2007: the Sixteenth International Heterogeneity in Computing Workshop, held in conjunction with IPDPS 2007, Long Beach, California, USA, March 2007.
   Keywords: Madeleine, LEGO.
   

   @InProceedings{ inproceedingsaumage.abmn_07,
   author = {Olivier Aumage and Elisabeth Brunet and Guillaume Mercier and Raymond Namyst},
   booktitle = {HCW 2007: the Sixteenth International Heterogeneity in Computing Workshop, held in conjunction with IPDPS 2007},
   title = {High-Performance Multi-Rail Support with the NewMadeleine Communication Library},
   year = {2007},
   address = {Long Beach, California, USA},
   month = {March},
   keywords = {Madeleine, LEGO} 
   }
   




7. Yves Caniou, Eddy Caron, Hélène Courtois, Benjamin Depardon, and Romain Teyssier. Cosmological Simulations using Grid Middleware. In Fourth High-Performance Grid Computing Workshop (HPGC'07), Long Beach, California, USA, March 2007. IEEE.
   Keywords: DIET, LEGO.
   

   @InProceedings{ inproceedingscaniou.cccdt_07,
   address = {Long Beach, California, USA},
   author = {Caniou, Yves and Caron, Eddy and Courtois, H{\'e}l{\`e}ne and Depardon, Benjamin and Teyssier, Romain},
   booktitle = {Fourth High-Performance Grid Computing Workshop (HPGC'07)},
   keywords = {DIET, LEGO},
   month = mar,
   publisher = {IEEE},
   title = {Cosmological Simulations using Grid Middleware},
   year = {2007} 
   }
   




8. H. Courtois, R. Tully, and R. Fisher. Distances In The Local Universe : New HI And I Band Surveys. In American Astronomical Society Meeting Abstracts, volume 210 of American Astronomical Society Meeting Abstracts, pages #121.13-+, July 2007.
   Note: Provided by the Smithsonian/NASA Astrophysics Data System.
   Keywords: LEGO.
   

   @InProceedings{ inproceedingscourtois.ctf_07,
   author = {{Courtois}, H. and {Tully}, R. and {Fisher}, R.},
   title = "{Distances In The Local Universe : New HI And I Band Surveys}",
   booktitle = {American Astronomical Society Meeting Abstracts},
   year = 2007,
   series = {American Astronomical Society Meeting Abstracts},
   volume = 210,
   month = jul,
   pages = {#121.13-+},
   url = {http://adsabs.harvard.edu/abs/2007AAS...21012113C},
   note = {Provided by the Smithsonian/NASA Astrophysics Data System},
   keywords = {LEGO} 
   }
   




9. Francois Trahay, Alexandre Denis, Olivier Aumage, and Raymond Namyst. Improving Reactivity and Communication Overlap in MPI using a Generic I/O Manager. In EuroPVM/MPI, 2007.
   Note: To appear.
   Keywords: LEGO.
   

   @InProceedings{ inproceedingstrahay.tdan_07,
   author = {Francois Trahay and Alexandre Denis and Olivier Aumage and Raymond Namyst},
   booktitle = {EuroPVM/MPI},
   title = {Improving Reactivity and Communication Overlap in MPI using a Generic I/O Manager},
   year = {2007},
   keywords = {LEGO},
   note = {To appear} 
   }
   

1. Yves Caniou, Eddy Caron, Benjamin Depardon, Hélène Courtois, and Romain Teyssier. Cosmological Simulations using Grid Middleware. Technical report RR2007-11, Laboratoire de l'Informatique du Parallélisme (LIP), March 2007.
   Note: Also available as INRIA Research Report 6139.
   Keywords: Grid computing, cosmological simulations, DIET, LEGO.

   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{ techreportrr-laboratoire-rr2007-11,
   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. },
   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 = mar,
   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},
   title = {Cosmological Simulations using Grid Middleware},
   year = 2007 
   }
   




2. Yves Caniou, Eddy Caron, Benjamin Depardon, Hélène Courtois, and Romain Teyssier. Cosmological Simulations using Grid Middleware. Technical report 6139, Institut National de Recherche en Informatique et en Automatique (INRIA), March 2007.
   Note: Also available as LIP Research Report 2007-11.
   Keywords: Grid computing, cosmological simulations, DIET, LEGO.

   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{ techreportrr-institut-6139,
   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. },
   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 = mar,
   note = {Also available as LIP Research Report 2007-11},
   number = {6139},
   title = {Cosmological Simulations using Grid Middleware},
   url = {http://hal.inria.fr/inria-00135189},
   year = 2007 
   }
   

1. Patrick Amestoy, Frédéric Camillo, Michel Daydé, Luc Giraud, Ronan Guivarch, Victoria Moya Lamiel, Marc Pantel, and Chiara Puglisi Amestoy. Goal and Status of the TLSE Platform. , 2007.
   Keywords: Grid computing, GRID-TLSE Project, ANR Project LEGO.
   

   @Unpublished{ unp-amestoy.acdggm-lpp-a_07,
   author = {Amestoy, Patrick and Camillo, Frédéric and Daydé, Michel and Giraud, Luc and Guivarch, Ronan and Moya Lamiel, Victoria and Pantel, Marc and Puglisi Amestoy, Chiara},
   title = "{Goal and Status of the TLSE Platform}",
   booktitle = "{First REDIMPS Workshop, Tokyo (Japan), 29/05/2007}",
   year = {2007},
   keywords = {Grid computing, GRID-TLSE Project, ANR Project LEGO} 
   }
   




2. Hrachya Astsatryan, Michel Daydé, Aurélie Hurault, Marc Pantel, and Eddy Caron. On defining a Web Interface for Linear Algebra Tasks over Computational Grids. , 2007.
   Keywords: Grid computing, ANR Project LEGO.
   

   @Unpublished{ unp-astsatryan.adhpc_07,
   author = {Astsatryan, Hrachya and Daydé, Michel and Hurault, Aurélie and Pantel, Marc and Caron, Eddy},
   title = "{On defining a Web Interface for Linear Algebra Tasks over Computational Grids}",
   booktitle = "{International Conference on Computer Science and Information Technologies (CSIT'07), Yerevan (Arménie), 24/09/2007-28/09/2007}",
   year = {2007},
   keywords = {Grid computing, ANR Project LEGO} 
   }
   

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html