BACK TO INDEX

Publications of year 2009
Articles in journals or book chapters
  1. Vincent Breton, Eddy Caron, Frédéric Desprez, and Gaël Le Mahec. High Performance BLAST Over the Grid. In Handbook of Research on Computational Grid Technologies for Life Sciences, Biomedicine and Healthcare, pages 121-148. IGI Global, 2009.
    Note: Hal number in2p3-00365202. 
    @InCollection{ InCollectionBreton.BCDL-M_09,
author = {Breton, Vincent and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Le Mahec, Ga{\"e}l},
booktitle = {Handbook of Research on Computational Grid Technologies for Life Sciences, Biomedicine and Healthcare},
note = {hal number in2p3-00365202},
pages = {121-148},
publisher = {IGI Global},
title = {High Performance BLAST Over the Grid},
url = {https://hal.inria.fr/in2p3-00365202},
year = 2009 
}


  2. Yves Caniou, Eddy Caron, Frédéric Desprez, Hidemoto Nakada, Keith Seymour, and Yoshio Tanaka. High performance GridRPC middleware. In G.A. Gravvanis, J.P Morrison, H.R. Arabnia, and D.A. Power, editors,Grid Technology and Applications: Recent Developments. Nova Science Publishers, 2009.
    Note: At Prepress. Pub. Date: 2009, 2nd quarter. ISBN 978-1-60692-768-7. hal-00751672.
    Keywords: DIET, GridRPC, LEGO. 
    @InCollection{ InCollectionCaniou.CCDNST_09,
author = {Caniou, Yves and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Nakada, Hidemoto and Seymour, Keith and Tanaka, Yoshio},
booktitle = {Grid Technology and Applications: Recent Developments},
editor = {Gravvanis, G.A. and Morrison, J.P and Arabnia, H.R. and Power, D.A.},
keywords = {DIET, GridRPC, LEGO},
note = {At Prepress. Pub. Date: 2009, 2nd quarter. ISBN 978-1-60692-768-7. hal-00751672},
publisher = {Nova Science Publishers},
title = {High performance {GridRPC} middleware},
url = {https://hal.inria.fr/hal-00751672},
year = 2009 
}


  3. Eddy Caron, Frédéric Desprez, Franck Petit, and Cédric Tedeschi. DLPT: A P2P tool for Service Discovery in Grid Computing. In Nick Antonopoulos, Georgios Exarchakos, Maozhen Li, and Antonio Liotta, editors,Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications. IGI Global, December 2009.
    Note: Released: December 2009. ISBN-13: 978-1615206865. hal-00758589.
    Keywords: DLPT, P2P, Service discovery. 
    @InCollection{ InCollectionCaron.CDPT_09,
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Petit, Franck and Tedeschi, C{\'e}dric},
booktitle = {Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications},
editor = {Antonopoulos, Nick and Exarchakos, Georgios and Li, Maozhen and Liotta, Antonio},
keywords = {DLPT, P2P, Service discovery},
month = {December},
note = {Released: December 2009. ISBN-13: 978-1615206865. hal-00758589},
publisher = {IGI Global},
title = {DLPT: A P2P tool for Service Discovery in Grid Computing},
url = {https://hal.inria.fr/hal-00758589},
year = {2009} 
}


Conference articles
  1. Jeremy Blaizot, Eddy Caron, Hélène Courtois, Benjamin Depardon, and Frédéric Desprez. Cosmological Simulations on a Grid of Computers. In Conference of the Invisible Universe, volume 1241, pages 816-825, June 2009. American Institute of Physics, AIP Conference Proceedings.
    Note: Hal number in2p3-00631723.
    Keywords: Cosmology, N-body simulations, Parallel computing, Local universe, Middleware, GridRPC, DIET, LEGO.
    Abstract: The work presented in this paper aims at restricting the input parameter values of the semi-analytical model used in Galics and MoMaF, so as to derive which parameters influence the most the results, e.g., star forma- tion, feedback and halo recycling efficiencies, etc. Our approach is to proceed empirically: we run lots of simulations and derive the correct ranges of values. The computation time needed is so large, that we need to run on a grid of com- puters. Hence, we model Galics and MoMaF execution time and output files size, and run the simulation using a grid middleware: Diet. All the complexity of accessing resources, scheduling simulations and managing data is harnessed by Diet and hidden behind a web portal accessible to the users. 

    @InProceedings{ InProceedingsBlaizot.BCCDD_09,
abstract = {The work presented in this paper aims at restricting the input parameter values of the semi-analytical model used in Galics and MoMaF, so as to derive which parameters influence the most the results, e.g., star forma- tion, feedback and halo recycling efficiencies, etc. Our approach is to proceed empirically: we run lots of simulations and derive the correct ranges of values. The computation time needed is so large, that we need to run on a grid of com- puters. Hence, we model Galics and MoMaF execution time and output files size, and run the simulation using a grid middleware: Diet. All the complexity of accessing resources, scheduling simulations and managing data is harnessed by Diet and hidden behind a web portal accessible to the users.},
author = {Blaizot, Jeremy and Caron, Eddy and Courtois, H{\'e}l{\`e}ne and Depardon, Benjamin and Desprez, Fr{\'e}d{\'e}ric},
booktitle = {Conference of the Invisible Universe},
keywords = {Cosmology, N-body simulations, Parallel computing, Local universe, Middleware, GridRPC, DIET, LEGO},
month = jun,
note = {hal number in2p3-00631723},
number = {1},
organization = {American Institute of Physics},
pages = {816-825},
publisher = {AIP Conference Proceedings},
title = {Cosmological Simulations on a Grid of Computers},
url = {https://hal.inria.fr/in2p3-00631723v1},
volume = {1241},
year = 2009 
}


  2. Yves Caniou, Eddy Caron, Ghislain Charrier, and Frédéric Desprez. Meta-Scheduling and Task Reallocation in a Grid Environment. In The Third IEEE International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2009), Sliema, Malta, pages 6p., October 2009.
    Note: Hal-00751680. 
    @InProceedings{ InProceedingsCaniou.CCCD_09,
address = {Sliema, Malta},
author = {Caniou, Yves and Caron, Eddy and Charrier, Ghislain and Desprez, Fr{\'e}d{\'e}ric},
booktitle = {The Third IEEE International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2009)},
month = {October},
note = {hal-00751680},
pages = {6p.},
title = {Meta-Scheduling and Task Reallocation in a Grid Environment},
url = {https://hal.inria.fr/hal-00751680},
year = {2009} 
}


  3. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric. In Euro-Par 2009, volume LNCS 5704, Delft, The Netherlands, pages 602-614, August 25-28 2009. TU Delft.
    Note: Hal-01427994.
    Keywords: LEGO. 
    @InProceedings{ InProceedingsCaron.CDDL_09,
address = {Delft, The Netherlands},
author = {Caron, Eddy and Datta, Ajoy and Depardon, Benjamin and Larmore, Lawrence},
booktitle = {Euro-Par 2009},
keywords = {LEGO},
month = {August 25-28},
note = {hal-01427994},
organization = {TU Delft},
pages = {602-614},
title = {A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric},
url = {https://hal.inria.fr/hal-01427994},
volume = {LNCS 5704},
year = {2009} 
}


  4. Eddy Caron, Frédéric Desprez, David Loureiro, and Adrian Muresan. Cloud Computing Resource Management through a Grid Middleware: A Case Study with DIET and Eucalyptus. In IEEE International Conference on Cloud Computing (CLOUD 2009), Bangalore, India, Septembre 2009. IEEE.
    Note: Published In the Work-in-Progress Track from the CLOUD-II 2009 Research Track. hal-01427879.
    Keywords: Cloud Computing, DIET.
    Abstract: The Cloud phenomenon is quickly growing towards becoming the de facto standard of Internet Computing, storage and hosting both in industry and academia. The large scalability possibilities offered by Cloud platforms can be harnessed not only for services and applications hosting but also as a raw on-demand computing resource. This paper proposes the use of a Cloud system as a raw computational on-demand resource for a Grid middleware. We illustrate a proof of concept by considering the DIET-Solve Grid middleware and the Eucalyptus open-source Cloud platform. 

    @InProceedings{ InProceedingsCaron.CDLM_09,
abstract = {The Cloud phenomenon is quickly growing towards becoming the de facto standard of Internet Computing, storage and hosting both in industry and academia. The large scalability possibilities offered by Cloud platforms can be harnessed not only for services and applications hosting but also as a raw on-demand computing resource. This paper proposes the use of a Cloud system as a raw computational on-demand resource for a Grid middleware. We illustrate a proof of concept by considering the DIET-Solve Grid middleware and the Eucalyptus open-source Cloud platform.},
address = {Bangalore, India},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Loureiro, David and Muresan, Adrian},
booktitle = {IEEE International Conference on Cloud Computing (CLOUD 2009)},
keywords = {Cloud Computing, DIET},
month = {Septembre},
note = {Published In the Work-in-Progress Track from the CLOUD-II 2009 Research Track. hal-01427879},
publisher = {IEEE},
title = {Cloud Computing Resource Management through a Grid Middleware: A Case Study with DIET and Eucalyptus},
url = {https://hal.inria.fr/hal-01427879},
year = {2009} 
}


  5. Eddy Caron, Cristian Klein, and Christian Pérez. Efficient Grid Resource Selection for a CEM Application. In RenPar'19. 19ème Rencontres Francophones du Parallélisme, Toulouse, 2009.
    Note: Hal number inria-00564612. 
    @InProceedings{ InProceedingsCaron.CKP_09,
address = {Toulouse},
author = {Caron, Eddy and Klein, Cristian and P{\'e}rez, Christian},
booktitle = {RenPar'19. 19{\`e}me Rencontres Francophones du Parall{\'e}lisme},
note = {hal number inria-00564612},
title = {Efficient Grid Resource Selection for a CEM Application},
url = {https://hal.inria.fr/inria-00564612},
year = 2009 
}


Internal reports
  1. Jeremy Blaizot, Eddy Caron, Hélène Courtois, Benjamin Depardon, and Frédéric Desprez. Cosmological Simulations on a Grid of Computers. Technical report RR-7093, Institut National de Recherche en Informatique et en Automatique (INRIA), November 2009.
    Note: Hal number inria-00431637.
    Keywords: Cosmology, N-body simulations, Parallel computing, Local universe, Middleware, GridRPC, DIET, LEGO.
    Abstract: The work presented in this paper aims at restricting the input parameter values of the semi-analytical model used in Galics and MoMaF, so as to derive which parameters influence the most the results, e.g., star forma- tion, feedback and halo recycling efficiencies, etc. Our approach is to proceed empirically: we run lots of simulations and derive the correct ranges of values. The computation time needed is so large, that we need to run on a grid of com- puters. Hence, we model Galics and MoMaF execution time and output files size, and run the simulation using a grid middleware: Diet. All the complexity of accessing resources, scheduling simulations and managing data is harnessed by Diet and hidden behind a web portal accessible to the users. 

    @TechReport{ TechReportRR-Institut-RR-7093,
abstract = {The work presented in this paper aims at restricting the input parameter values of the semi-analytical model used in Galics and MoMaF, so as to derive which parameters influence the most the results, e.g., star forma- tion, feedback and halo recycling efficiencies, etc. Our approach is to proceed empirically: we run lots of simulations and derive the correct ranges of values. The computation time needed is so large, that we need to run on a grid of com- puters. Hence, we model Galics and MoMaF execution time and output files size, and run the simulation using a grid middleware: Diet. All the complexity of accessing resources, scheduling simulations and managing data is harnessed by Diet and hidden behind a web portal accessible to the users.},
author = {Blaizot, Jeremy and Caron, Eddy and Courtois, H{\'e}l{\`e}ne and Depardon, Benjamin and Desprez, Fr{\'e}d{\'e}ric},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
keywords = {Cosmology, N-body simulations, Parallel computing, Local universe, Middleware, GridRPC, DIET, LEGO},
month = nov,
note = {hal number inria-00431637},
number = {RR-7093},
title = {Cosmological Simulations on a Grid of Computers},
url = {http://hal.inria.fr/inria-00431637},
year = 2009 
}


  2. Yves Caniou, Eddy Caron, Ghislain Charrier, Frédéric Desprez, Eric Maisonnave, and Vincent Pichon. Ocean-Atmosphere Application Scheduling within DIET. Technical report RR-6836, Institut National de Recherche en Informatique et en Automatique (INRIA), February 2009.
    Note: Hal number inria-00359972.
    Keywords: DIET, LEGO. 
    @TechReport{ TechReportRR-Institut-RR-6836,
author = {Caniou, Yves and Caron, Eddy and Charrier, Ghislain and Desprez, Fr{\'e}d{\'e}ric and Maisonnave, Eric and Pichon, Vincent},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
keywords = {DIET, LEGO},
month = {February},
note = {hal number inria-00359972},
number = {RR-6836},
title = {Ocean-Atmosphere Application Scheduling within {DIET}},
url = {https://hal.inria.fr/inria-00359972},
year = {2009} 
}


  3. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric. Research report RRLIP2009-33, Laboratoire de l'Informatique du Parallélisme (LIP), 2009.
    Note: Also available as INRIA Research Report 7146. Hal number ensl-00440266.
    Keywords: LEGO. 
    @TechReport{ TechReportRR-Laboratoire-RRLIP2009-33,
author = {Caron, Eddy and Datta, Ajoy and Depardon, Benjamin and Larmore, Lawrence},
institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
keywords = {LEGO},
note = {Also available as INRIA Research Report 7146. Hal number ensl-00440266},
number = {RRLIP2009-33},
title = {A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric},
type = {Research report},
url = {https://hal.inria.fr/ensl-00440266},
year = {2009} 
}


  4. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric. Research report RR-7146, Institut National de Recherche en Informatique et en Automatique (INRIA), 2009.
    Note: Also available as LIP Research Report 2009-33. Hal number inria-00440276.
    Keywords: LEGO. 
    @TechReport{ TechReportRR-Institut-RR-7146*1,
author = {Caron, Eddy and Datta, Ajoy and Depardon, Benjamin and Larmore, Lawrence},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
keywords = {LEGO},
note = {Also available as LIP Research Report 2009-33. Hal number inria-00440276},
number = {RR-7146},
title = {A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric},
type = {Research report},
url = {https://hal.inria.fr/inria-00440276},
year = {2009} 
}


  5. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing K-clustering algorithm using an arbitrary metric. Research report RR2009-33, Laboratoire de l'Informatique du Parallélisme (LIP), December 2009.
    Note: 32 pages. (revised version of RR2008-31). Also available as INRIA Research Report 7146. hal number: ensl-00440266.
    Keywords: k-clustering, self-stabilization, weighted graph, LEGO.
    Abstract: {M}obile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. {C}ommunication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. {A} k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. {A} self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique {ID}s and weighted edges. {T}he algorithm is comparison-based, takes {O}(nk) time, and uses {O}(log n + log k) space per process, where n is the size of the network. {T}his is the first distributed solution to the k-clustering problem on weighted graphs. 

    @TechReport{ TechReportRR-Laboratoire-RR2009-33,
abstract = {{M}obile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. {C}ommunication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. {A} k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. {A} self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique {ID}s and weighted edges. {T}he algorithm is comparison-based, takes {O}(nk) time, and uses {O}(log n + log k) space per process, where n is the size of the network. {T}his is the first distributed solution to the k-clustering problem on weighted graphs.},
author = {Caron, Eddy and Datta, Ajoy and Depardon, Benjamin and Larmore, Lawrence},
institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
keywords = {k-clustering, self-stabilization, weighted graph, LEGO},
month = {December},
note = {32 pages. (revised version of RR2008-31). Also available as INRIA Research Report 7146. hal number: ensl-00440266},
number = {RR2009-33},
title = {A Self-Stabilizing K-clustering algorithm using an arbitrary metric},
type = {Research report},
url = {http://prunel.ccsd.cnrs.fr/ensl-00440266/en/},
year = {2009} 
}


  6. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing K-clustering algorithm using an arbitrary metric. Research report RR-7146, Institut National de Recherche en Informatique et en Automatique (INRIA), December 2009.
    Note: 41 pages. Also available as LIP Research Report RR2009-33. hal number: inria-00440276.
    Keywords: k-clustering, self-stabilization, weighted graph, LEGO.
    Abstract: {M}obile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. {C}ommunication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. {A} k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. {A} self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique {ID}s and weighted edges. {T}he algorithm is comparison-based, takes {O}(nk) time, and uses {O}(log n + log k) space per process, where n is the size of the network. {T}his is the first distributed solution to the k-clustering problem on weighted graphs. 

    @TechReport{ TechReportRR-Institut-RR-7146,
abstract = {{M}obile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. {C}ommunication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. {A} k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. {A} self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique {ID}s and weighted edges. {T}he algorithm is comparison-based, takes {O}(nk) time, and uses {O}(log n + log k) space per process, where n is the size of the network. {T}his is the first distributed solution to the k-clustering problem on weighted graphs.},
author = {Caron, Eddy and Datta, Ajoy and Depardon, Benjamin and Larmore, Lawrence},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
keywords = {k-clustering, self-stabilization, weighted graph, LEGO},
month = {December},
note = {41 pages. Also available as LIP Research Report RR2009-33. hal number: inria-00440276},
number = {RR-7146},
title = {A Self-Stabilizing K-clustering algorithm using an arbitrary metric},
type = {Research report},
url = {http://hal.inria.fr/inria-00440276/en},
year = {2009} 
}


  7. Eddy Caron, Frédéric Desprez, David Loureiro, and Adrian Muresan. Cloud Computing Resource Management through a Grid Middleware: A Case Study with DIET and Eucalyptus. Technical report RR-7096, Institut National de Recherche en Informatique et en Automatique (INRIA), 2009.
    Note: Hal number inria-00435785.
    Keywords: Cloud Computing, DIET.
    Abstract: The Cloud phenomenon is quickly growing towards becoming the de facto standard of Internet Computing, storage and hosting both in industry and academia. The large scalability possibilities offered by Cloud platforms can be harnessed not only for services and applications hosting but also as a raw on-demand computing resource. This paper proposes the use of a Cloud system as a raw computational on-demand resource for a Grid middleware. We illustrate a proof of concept by considering the DIET-Solve Grid middleware and the Eucalyptus open-source Cloud platform. 

    @TechReport{ TechReportRR-Institut-RR-7096,
abstract = {The Cloud phenomenon is quickly growing towards becoming the de facto standard of Internet Computing, storage and hosting both in industry and academia. The large scalability possibilities offered by Cloud platforms can be harnessed not only for services and applications hosting but also as a raw on-demand computing resource. This paper proposes the use of a Cloud system as a raw computational on-demand resource for a Grid middleware. We illustrate a proof of concept by considering the DIET-Solve Grid middleware and the Eucalyptus open-source Cloud platform.},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Loureiro, David and Muresan, Adrian},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
keywords = {Cloud Computing, DIET},
note = {hal number inria-00435785},
number = {RR-7096},
title = {Cloud Computing Resource Management through a Grid Middleware: A Case Study with DIET and Eucalyptus},
url = {https://hal.inria.fr/inria-00435785},
year = {2009} 
}


  8. Eddy Caron and Cédric Tedeschi. Service Discovery system: architecture and algorithms. Technical report 1.3, ANR SPADES. 08-ANR-SEGI-025, Septembre 2009.
    Note: Hal-01428031. 
    @TechReport{ TechReportRR-ANR-1.3,
author = {Caron, Eddy and Tedeschi, C\'edric},
institution = {ANR SPADES. 08-ANR-SEGI-025},
month = {Septembre},
note = {hal-01428031},
number = {1.3},
title = {Service Discovery system: architecture and algorithms},
url = {https://hal.inria.fr/hal-01428031},
year = {2009} 
}



BACK TO INDEX



Disclaimer:

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.



Last modified: Sun Nov 24 17:35:52 2024
Author: ecaron.

This document was translated from BibTEX by bibtex2html