@InBook{CDLB09,
author = {V. Breton and E. Caron and F. Desprez and G. Le Mahec},
title = "{Handbook of Research on Computational Grid Technologies for Life Sciences, Biomedicine and Healthcare}",
chapter = "{High Performance BLAST Over the Grid}",
publisher = {IGI Global},
year = 2009,
month = {May},
isbn = {978-1-60566-374-6},
annote = {\url{http://www.igi-global.com/reference/details.asp?ID=34292}}
}
@inbook{ChapterGridRPC09,
Author = {Caniou, Yves and Caron, Eddy and Desprez, Frédéric and Nakada, Hidemoto and Seymour, Keith and Tanaka, Yoshio},
Chapter = {High performance GridRPC middleware},
Editor = {Gravvanis, G.A. and Morrison, J.P and Arabnia, H.R. and Power, D.A.},
Publisher = {Nova Science Publishers},
Title = {Recent Developments in Grid Technology and Applications},
Year = {2009},
month = {April},
isbn = {160692768X}
}
@Book{DFKL07,
editor = {Fr\'ed\'eric Desprez and Eric Fleury and Alexey Kalinov and Alexey Lastovetsky},
title = "{Algorithms And Tools for Parallel Computing on Heterogeneous Clusters}",
publisher = {Nova Science Pub Inc},
year = 2007}
@InBook{ InB-Antoniu.ABBCDJMS_06,
author = {Gabriel Antoniu and Marin Bertier and Luc Boug{\'e} and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Mathieu Jan and S{\'e}bastien Monnet and Pierre Sens},
chapter = {GDS: An Architecture Proposal for a Grid Data-Sharing Service},
keywords = {JuxMem,DIET},
publisher = {Springer Verlag},
series = {Proceedings of the Workshop on Future Generation Grids November 1-5, 2004, Dagstuhl, Germany},
title = {{Future Generation Grids}},
volume = {XVIII, CoreGrid Series},
year = {2006}
}
%% editor = {Getov, Vladimir; Laforenza, Domenico; Reinefeld, Alexander (Eds.)},
@InBook{ InB-Caron.CDLHPP_06,
author = {E. Caron and F. Desprez and J.-Y. L'Excellent and C. Hamerling and M. Pantel and C. Puglisi-Amestoy},
chapter = {Use of A Network Enabled Server System for a Sparse Linear Algebra Application},
keywords = {DIET},
publisher = {Springer Verlag},
series = {Proceedings of the Workshop on Future Generation Grids November 1-5, 2004, Dagstuhl, Germany},
title = {{Future Generation Grids}},
volume = {XVIII, CoreGrid Series},
year = {2006}
}
%% editor = {Getov, Vladimir; Laforenza, Domenico; Reinefeld, Alexander (Eds.)},
@inbook{CDF+02,
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Fleury, Eric and Lombard, Fr{\'e}d{\'e}ric and Nicod, Jean-Marc and Quinson, Martin and Suter, Fr{\'e}d{\'e}ric},
Chapter = {Une approche hi{\'e}rarchique des serveurs de calculs},
Date-Modified = {2005-04-08 15:55:58 +0200},
Keywords = {Metacomputing, DIET},
Note = {ISBN 2-7462-0472-X},
Publisher = {Herm{\`e}s Science Paris},
Title = {Calcul r{\'e}parti {\`a} grande {\'e}chelle},
Year = 2002}
%% Editor = {Fran{\c c}oise Baude, INRIA--Univ. de Nice--I3S},
@inproceedings{FC02,
Address = {Aussois, France},
Author = {Caron, E. and Desprez, F.},
Booktitle = {Actes de l'Ecole th{\'e}matique sur la globalisation des ressources informatiques et des donn{\'e}es},
Keyword = {Metacomputing GridRPC},
Month = dec,
Pages = {87-98},
Title = {{GridRPC: Approche RPC pour la simulation sur la grille}},
Year = {2002}}
@proceedings{FRM01,
Address = {Valence, Spain},
Editor = {Desprez, F. and Fleury, E. and M{\'e}haut, J.-F.},
Keyword = {grid computing},
Month = {AUG},
Organization = {IEEE Computer Society},
Title = {Workshop on Metacomputing and Applications (MSA'2001)},
Year = 2001}
@proceedings{FRMR00,
Address = {Toronto, Canada},
Editor = {Desprez, F. and Fleury, E. and M{\'e}haut, J.-F. and Robert, Y.},
Keyword = {grid computing},
Month = {AUG},
Organization = {IEEE Computer Society},
Title = {Workshop on Metacomputing and Applications (MSA'2000)},
Year = 2000}
@Article{BBD+09,
author = {Bertis, V. and Bolze, R. and Desprez, F. and Reed, K.},
title = "{From Dedicated Grid to Volunteer Grid: Large Scale Execution of a Bioinformatics Application}",
journal = {Journal of Grid Computing},
year = 2009,
volume = 7,
number = 4,
pages = {463-478},
month = DEC
}
@article{1388289,
author = {Amar, A. and Bolze, R. and Caniou, Y. and Caron, E. and Chis, A. and Desprez, F. and Depardon, B. and Gay, J.-S. and Le Mahec, G. and Loureiro, D.},
title = "{Tunable Scheduling in a GridRPC Framework}",
journal = {Concurrency and Computation: Practice \& Experience},
volume = {20},
number = {9},
year = {2008},
issn = {1532-0626},
pages = {1051--1069},
doi = {http://dx.doi.org/10.1002/cpe.v20:9},
publisher = {John Wiley and Sons Ltd.},
address = {Chichester, UK, UK},
}
@Article{ ArticleCaron.CCDS_FGCS08,
author = {Caron, Eddy and Chis, Andr{\'e}ea and Desprez, Fr{\'e}d{\'e}ric and Su, Alan},
journal = {Future Generation Computer Systems},
keywords = {Scheduling, DIET, LEGO},
volumee = {24},
pages = {46-57},
title = {Design of plug-in schedulers for a GridRPC environment},
year = {2008}
}
@article{CDT07,
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
Editor = {Springer Netherlands},
Journal = {Journal of Grid Computing},
Month = {September},
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},
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{ ArticleDail.DD_I06,
author = {H. Dail and F. Desprez},
title = {Experiences with Hierarchical Request Flow Management for Network-Enabled Server Environments},
journal = {{International Journal of High Performance Computing Applications}},
volume = 20,
number = 1,
month = {February},
year = {2006}
}
@Article{DV06,
author = {Desprez, F. and Vernois, A.},
title = "{Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid}",
journal = {Journal Of Grid Computing},
year = 2006,
volume = 4,
number = 1,
pages = {19-31},
month = MAR
}
@article{CDDJN06,
Author = {Caron, E. and Del-Fabbro, B. and Desprez, F. and Jeannot, E. and Nicod, J.-M.},
Journal = {Scientific Programming Journal},
Number = {4},
Pages = {333-354},
Title = {Managing Data Persistence in Network Enabled Servers},
Volume = {13},
Year = {2005}}
@Article{ ArticleCaron.CD_IJHPCA06,
abstract = {Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classical client-server or Remote Procedure Call (RPC) paradigm. Network Enabled Servers implement this model also called GridRPC. Clients submit computation requests to a scheduler whose goal is to find a server available on the grid. The aim of this paper is to give an overview of a middleware developed by the GRAAL team called DIET (for Distributed Interactive Engineering Tool-box). DIET is a hierarchical set of components used for the development of applications based on computational servers on the grid.},
author = {Caron, E. and Desprez, F.},
journal = {International Journal of High Performance Computing Applications},
number = {3},
pages = {335-352},
title = "{DIET: A Scalable Toolbox to Build Network Enabled Servers on the Grid}",
volume = {20},
year = {2006}
}
@Article{ ArticleBolze.BCCDDJJLLMMNPQRTI_IJHPCA06,
author = {Bolze, Rapha{\"e}l and Cappello, Franck and Caron, Eddy and Dayd{\'e}, Michel and Desprez, Frederic and Jeannot, Emmanuel and J{\'e}gou, Yvon and Lanteri, St{\'e}phane and Leduc, Julien and Melab, Noredine and Mornet,Guillaume and Namyst, Raymond and Primet, Pascale and Quetier, Benjamin and Richard, Olivier and Talbi, El-Ghazali and Touch{\'e} Irena},
journal = {International Journal of High Performance Computing Applications},
keywords = {Grid'5000, DIET},
number = {4},
pages = {481-494},
volume = {20},
title = "{Grid'5000: A Large Scale and Highly Reconfigurable Experimental Grid Testbed}",
year = {2006}
}
@article{CDD+05,
Author = {Caron, E. and Desprez, F. and Dayd{\'e}, M. and Hurault, A. and Pantel, M.},
Date-Added = {2005-08-02 15:40:28 +0200},
Date-Modified = {2005-08-02 15:44:37 +0200},
Journal = {Computing Letters (CoLe)},
Number = {3},
Pages = {1-5},
Title = {{On Deploying Scientific Software within the Grid-TLSE Project}},
Volume = {1},
Year = {2005}}
@article{DS04,
Author = {Fr{\'e}d{\'e}ric Desprez and Fr{\'e}d{\'e}ric Suter},
Journal = {Concurrency \& Computation, Practice \& Experience},
Note = {Also available as INRIA Research Report RR-4482 at \url{ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4482.ps.gz}},
number = 8,
pages = {771-797},
month = JUL,
Title = {{Impact of Mixed-Parallelism on Parallel Implementations of Strassen and Winograd Matrix Multiplication Algorithms}},
Volume = {16},
Year = {2004}}
@article{CDQS04,
Author = {E. Caron and F. Desprez and M. Quinson and F. Suter},
Journal = {The International Journal on High Performance Computing and Applications},
Number = {3},
Pages = {373-390},
Title = {{Performance Evaluation of Linear Algebra Routines for Network Enabled Servers}},
Volume = {18},
Year = {2004}}
@Article{ ArticleCaron.CDS_PDCPP03,
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Suter, Fr{\'e}d{\'e}ric},
journal = {Parallel and Distributed Computing Practice (PDCP)},
month = {March},
note = {Special Isue: Internet-Based Computing},
number = {1},
pages = {57-69},
title = {Parallel Extension of a Dynamic Performance Forecasting Tool},
volume = {6},
year = {2003}
}
@article{CCC+01,
Author = {Caron, E. and Chaumette, S. and Contassot-Vivier, S. and Desprez, F. and Fleury, E. and Gomez, C. and Goursat, M. and Jeannot, E. and Lazure, D. and Lombard, F. and Nicod, J.M. and Philippe, L. and Quinson, M. and Ramet, P. and Roman, J. and Rubi, F. and Steer, S. and Suter, F. and Utard, G.},
Journal = {Parallel Computing},
Keyword = {Scilab, grid computing, parallel linear algebra},
Number = {27},
Pages = {1497-1519},
Title = {{Scilab to Scilab//, the OURAGAN Project}},
Volume = {11},
Year = {2001}}
@article{CD00,
Author = {Chaussumier, F. and Desprez, F.},
Journal = {Parallel and Distributed Computing Practices},
Title = {{Communications Optimizations and Efficient Load-Balancing for a Volume Rendering Algorithm on a Cluster of PCs}},
Volume = {3},
Number = {3},
Year = {2000}}
@inproceedings{DIETCloudWP09,
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, E. and Desprez, F. and Loureiro, D. and Muresan, A.},
Booktitle = {IEEE International Conference on Cloud Computing (CLOUD 2009)},
Editor = {IEEE},
Keywords = {Cloud, DIET},
Month = {September},
Note = {To appear in the Work-in-Progress Track from the CLOUD-II 2009 Research Track.},
Title = {Cloud Computing Resource Management through a Grid Middleware: A Case Study with DIET and Eucalyptus},
Year = {2009}
}
@InProceedings{CCD09,
author = {Caniou, Y. and Caron, E. and Charrier, G. and Desprez, F.},
title = "{Meta-Scheduling and Task Reallocation in a Grid Environment}",
booktitle = {The Third International Conference on Advanced Engineering Computing and Applications in Sciences, ADVCOMP'2009},
year = 2009,
address = {Sliema, Malta},
month = {October}
}
@inproceedings{DAGDA08,
Address = {Indianapolis, Indiana, USA},
Author = {Desprez, Frédéric and Caron, Eddy and Le Mahec, Gaël},
Booktitle = {AHEMA 2008. International Workshop on Advances in High-Performance E-Science Middleware and Applications. In conjunction with eScience 2008.},
publisher = {IEEE},
Month = {December 11th},
Organization = {IEEE},
Title = {DAGDA: Data Arrangement for the Grid and Distributed Applications},
Year = {2008}
}
@inproceedings{LEGO_Ocean08b,
Address = {Sydney. Australia. },
Author = {Caniou, Yves and Caron, Eddy and Charrier, Ghislain and Desprez, Frédéric and Maisonnave, Eric and Pichon, Vincent},
Booktitle = {APDCT-08 Symposium. International Symposium on Advanced in Parallel and Distributed Computing Techniques.},
Month = {December 10-12},
Organization = {In conjunction with ISPA'2008.},
Pages = {675-680},
Publisher = {IEEE Computer Society},
Title = {Ocean-Atmosphere Application Scheduling within DIET},
Year = {2008}}
@inproceedings{SysC08,
Address = {Sydney. Australia. },
Author = {Combes, Philippe and Caron, Eddy and Desprez, Frédéric and Chopard, Bastien and Zory, Julien},
Booktitle = {ISPA 2008. International Symposium on Parallel and Distributed Processing with Applications},
Month = {December 10-12},
Pages = {180-187},
Publisher = {IEEE Computer Society},
Title = {Relaxing Synchronization in a Parallel SystemC Kernel},
Year = {2008}}
@inproceedings{DIETDashboard,
Title = {All-in-one Graphical Tool for the management of DIET a GridRPC Middleware},
Author = {Caron, Eddy and Desprez, Frédéric and Loureiro, David},
Address = {Barcelona, Spain},
Booktitle = {CoreGRID Workshop on Grid Middleware (in conjunction with OGF'23)},
Month = {June 2-6},
Year = {2008}}
@inproceedings{GCD08,
Author = {Caron, Eddy and Desprez, Frédéric and Le Mahec, Gaël},
Title = {Parallelization and Distribution Strategies of Large Bioinformatics Requests over the Grid},
Booktitle = {International Conference on Algorithms and Architectures 2008 (ICA3PP 2008)},
Address = {Cyprus},
Month = {June},
Publisher = {Springer Verlag},
Year = {2008}}
@InProceedings{BD08,
author = {Bouteiller, Aurélien and Desprez, Frédéric},
title = {Fault Tolerance Management for a Hierarchical GridRPC Middleware},
booktitle = {8th IEEE International Symposium on Cluster Computing and the Grid (CCGRID)},
year = 2008,
publisher = {IEEE}
}
@inproceedings{BBD+08,
Title = {Large Scale Execution of a Bioinformatic Application on a Volunteer Grid},
Author = {Bertis, Viktors and Bolze, Raphaël and Desprez, Frédéric and Reed, Kevin},
Booktitle = {PDSEC - Workshop on Parallel and Distributed Scientific and Engineering Computing},
Organization = {In conjunction with IPDPS 2008.},
Address = {Miami, Florida},
Month = apr,
Year = {2008}}
@inproceedings{CCD08,
Title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
Author = {Caron, Eddy and Chouhan, Pushpinder Kaur and Desprez, Frédéric},
Booktitle = {The 17th Heterogeneous Computing Workshop (HCW'08). },
Organization = {In conjunction with IPDPS 2008.},
Address = {Miami, Florida},
Month = apr,
Year = {2008}}
@InProceedings{ InProceedingsCaron.CDT_08,
abstract = {The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design of many peer-to-peer fashioned approaches. More specifically, the need for flexibility and complexity in the service discovery has seen the emergence of a new kind of overlays, based on tries, also known as lexicographic trees. Although these overlays are efficient and well designed, they require a costly maintenance and do not accurately take into account the heterogeneity of nodes and the changing popularity of the services requested by users. In this paper, we focus on reducing the cost of the maintenance of a particular architecture, based on a dynamic prefix tree, while enhancing it with some load balancing techniques that dynamically adapt the load of the nodes in order to maximize the throughput of the system. The algorithms developed couple a self-organizing prefix tree overlay with load balancing techniques inspired by similar previous works undertaken for distributed hash tables. After some simulation results showing how our load balancing heuristics perform in such an overlay and compare to other heuristics, we provide a fair comparison of this architecture and similar overlays recently proposed.},
address = {Miami, Florida},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
booktitle = {Fifth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P)},
month = apr,
organization = {In conjunction with IPDPS 2008.},
title = {Efficiency of Tree-structured Peer-to-peer Service Discovery Systems},
year = {2008}
}
@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.},
keywords = {DIET, JuxMem, LEGO},
month = {December 17-20},
title = {Towards a Transparent Data Access Model for the GridRPC Paradigm},
year = {2007}
}
@INPROCEEDINGS{CDPT07,
address = {Paris, France},
author = {Caron, Eddy and Desprez, Fr\'ed\'eric and Petit, Franck and Tedeschi, C\'edric},
booktitle = {9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS2007},
editor = {Toshimitsu Masuzawa and S\'ebastien Tixeuil},
month = {November, 14-16},
publisher = {Springer Verlag Berlin Heidelberg},
series = {LNCS},
title = {{Snap-stabilizing Prefix Tree for Peer-to-peer Systems}},
volume = {4838},
pages = {82-96},
year = {2007}
}
@InProceedings{DV07,
author = {Desprez, Frédéric and Vernois, Antoine},
title = "{Semi-Static Algorithms for Data Replication and Scheduling Over the Grid}",
booktitle = {IEEE 3rd International Conference on Intelligent Computer Communication and Processing, workshop on Grid Computing},
year = 2007,
address = {Cluj-Napoca, Romania},
month = SEP}
@InProceedings{ InProceedingsAmar.ABBCCCCDDDGL-MS_06,
address = {Dresden, Germany},
author = {Amar, Abelkader and Bolze, Rapha{\"e}l and Bouteiller, Aur{\'e}lien and Chouhan, Pushpinder Kaur and Chis, Andr{\'e}ea and Caniou, Yves and Caron, Eddy and Dail, Holly and Depardon, Benjamin and Desprez, Fr{\'e}d{\'e}ric and Gay, Jean-S{\'e}bastien and Le Mahec, Ga{\"e}l and Su, Alan},
booktitle = {CoreGRID Workshop on Grid Middleware (in conjunction with EuroPar2006)},
keywords = {DIET},
month = {August 28-29},
title = "{Diet: New Developments and Recent Results}",
year = {2006}
}
@InProceedings{ InProceedingsChis.CCDS_06,
address = {Melbourne, Australia},
author = {Chis, Andr{\'e}ea and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Su, Alan},
booktitle = {4th International Workshop on Middleware for Grid Computing - MGC 2006},
editor = {ACM/IFIP/USENIX},
keywords = {DIET, Scheduling},
month = {November 27th},
note = {In conjunction with ACM/IFIP/USENIX 7th International Middleware Conference 2006},
title = {Plug-in Scheduler Design for a Distributed Grid Environment},
year = {2006}
}
@inproceedings{BCD06,
editor = {Marina Gavrilova and Osvaldo Gervasi and Vipin Kumar and C.J. Kenneth
Tan and David Taniar and Antonio Lagan\`{a} and Youngsong Mun and Hyunseung Choo},
booktitle = {Computational Science and Its Applications - ICCSA 2006},
publisher = {Springer},
series = {Lecture Notes in Computer Sciencel},
volume = {3984},
year = {2006},
isbn = {3-540-34079-3},
author = {Raphael Bolze and Eddy Caron and Frederic Desprez and Georg Hoesch and
Cyril Pontvieux},
title = "{A Monitoring and Visualization Tool and Its Application for a
Network Enabled Server Platform}",
pages = {202--213}
}
@inproceedings{CDT06,
Address = {Cambridge, UK.},
Author = {Caron, Eddy and Desprez, Frédéric and Tedeschi, Cédric},
Booktitle = {The Sixth IEEE International Conference on Peer-to-Peer Computing, P2P2006},
Editor = {A. Montresor and A. Wierzbicki and N. Shahmehri},
Month = {September 6-8},
Pages = {106-113},
Publisher = {IEEE},
Title = {A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids},
Year = {2006}}
@inproceedings{CFPT06b,
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Fourdrignier, Charles and Petit, Franck and Tedeschi, C{\'e}dric},
Title = {A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems},
Booktitle = {{HiPC'2006}. 12th International Conference on High Performance Computing.},
Editor = {Yves Robert et al.},
Keywords = {P2P, Fault Tolerance, TPLD},
Month = {December 18-21},
Pages = {171-182},
Publisher = {Springer-Verlag Berlin Heidelberg},
Series = {Lecture Notes in Computer Sciencel},
Volume = {4297},
Address = {Bengalore. India},
Year = {2006}}
@InProceedings{CDPT05,
author = {Caron, Eddy and Desprez, Frédéric and Petit, Franck and Tedeschi, Cédric},
title = "{A Peer-to-Peer Extension of Network-Enabled Server Systems}",
booktitle = {e-Science 2005. First IEEE International Conference on e-Science and Grid Computing},
pages = {430-437},
year = {2005},
address = {Melbourne, Australia},
month = dec
}
@InProceedings{BDV05,
author = {Blanchet, Christophe and Desprez, Frédéric and Vernois, Antoine},
title = {{Simultaneous Scheduling of Replication and Computation for Bioinformatic Applications on the Grid}},
booktitle = {Biological and Medical Data Analysis, Proceedings of 6th International Symposium, ISBMDA 2005},
year = 2005,
address = {Aveiro, Portugal},
month = nov,
publisher = {Springer-Verlag GmbH},
volume = {3745 / 2005}
}
@inproceedings{CDD+05,
Author = {F. Cappello and F. Desprez and M. Dayde and E. Jeannot and Y. Jegou and S. Lanteri and N. Melab and R. Namyst and P. Primet and O. Richard and E. Caron and J. Leduc and G. Mornet},
Booktitle = {Proceedings of 6th IEEE/ACM Int'l Workshop on Grid Computing (Grid2005)},
Date-Modified = {2005-10-12 08:15:22 +0200},
Month = {NOV},
Owner = {desprez},
Title = {{Grid'5000: A Large Scale, Reconfigurable, Controlable and Monitorable Grid Platform}},
Year = {2005}}
@InProceedings{ InProceedingsDail.DD_05,
author = {Holly Dail and Frédéric Desprez},
title = {Adaptive window scheduling for a hierarchical agent system},
booktitle = {The Fourth International Symposium on Parallel and Distributed Computing (ISPDC 2005)},
publisher = {IEEE Computer Society},
year = {2005},
month = {July},
address = {Lille, France}
}
@inproceedings{CDS05,
Address = {Denver, CO},
Author = {Caron, E. and Desprez, F. and Suter, F.},
Booktitle = {Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS'05)},
Keywords = {Out-of-Core},
Month = Apr,
Title = {{Out-of-Core and Pipeline Techniques for Wavefront Algorithms}},
Year = {2005}}
@inproceedings{DV05,
Address = {Research Triangle Park, NC},
Author = {Desprez, Fr{\'e}d{\'e}ric and Vernois, Antoine},
Booktitle = {CLADE 2005},
Month = jul,
Publisher = {IEEE Computer Society Press},
Title = {{Simultaneous Scheduling of Replication and Computation for Bioinformatic Applications on the Grid}},
Year = {2005}}
@inproceedings{SLD+04,
Address = {Brussels, Belgium},
Author = {K. Seymour and C. Lee and F. Desprez and H. Nakada and Y. Tanaka},
Booktitle = {Workshop on Grid Application Programming Interfaces, In conjunction with GGF12},
Month = SEP,
Title = {{The End-User and Middleware APIs for GridRPC}},
Year = {2004}}
@inproceedings{CCD04,
Address = {Pittsburgh, Pennsylvania},
Author = {Caron, Eddy and Chouhan, Pushpinder-Kaur and Desprez, Frederic},
Booktitle = {{Grid Computing 2004}. IEEE International Conference On Grid Computing. Super Computing 2004},
Editor = {Rajkumar Buyya},
Month = oct,
Pages = {410-414},
Title = {Deadline scheduling with priority for client-server systems on the Grid},
Year = {2004}}
@inproceedings{CDS04,
Address = {Pisa, Italy},
Author = {Casanova, Henri and Desprez, Fr{\'e}d{\'e}ric and Suter, Fr{\'e}d{\'e}ric},
Booktitle = {Proceedings of the 10th International Euro-Par Conference (Euro-Par'04)},
Editor = {Danelutto, Marco and Laforenza, Domenico and Vanneschi, Marco},
Month = {August/September},
Pages = {230--237},
Publisher = {Springer},
Series = {Lecture Notes in Computer Sciencel},
Title = {{From Heterogeneous Task Scheduling to Heterogeneous Mixed Parallel Scheduling}},
Volume = {3149},
Year = {2004}}
@inproceedings{DJ04,
Address = {Cork, Ireland},
Author = {F. Desprez and E. Jeannot},
Booktitle = {3rd International Symposium on Parallel and Distributed Computing (ISPDC)},
Month = JUL,
Title = {{Improving the GridRPC Model with Data Persistence and Redistribution}},
Year = {2004}}
@inproceedings{CDPV03a,
Address = {Nice - France},
Author = {Caron, E. and Desprez, F. and Petit, F. and Villain, V.},
Booktitle = {Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS'03)},
Keywords = {Grid computing, DIET, Scheduling, Resource Reservation},
Month = apr,
Publisher = {IEEE Computer Society},
Title = {{A Hierarchical Resource Reservation Algorithm for Network Enabled Servers}},
Year = {2003}}
@inproceedings{BDS03,
Address = {Nice - France},
Author = {Boudet, V. and Desprez, F. and Suter, F.},
Booktitle = {Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS'03)},
Keywords = {Mixed Parallelism, Scheduling},
Month = APR,
Pdf = {http://dlib.computer.org/conferen/ipdps/1926/pdf/19260041b.pdf},
Publisher = {IEEE Computer Society},
Title = {{One-Step Algorithm for Mixed Data and Task Parallel Scheduling Without Data Replication}},
Year = {2003}}
@inproceedings{CDL+02a,
Address = {Paderborn, Germany},
Author = {Caron, E. and Desprez, F. and Lombard, F. and Nicod, J.-M. and Quinson, M. and Suter, F.},
Booktitle = {Proceedings of the 8th International EuroPar Conference},
Editor = {B. Monien and R. Feldmann},
Keywords = {Metacomputing, DIET},
Month = AUG,
Pages = {907--910},
Publisher = {Springer-Verlag},
Series = {Lecture Notes in Computer Sciencel},
Title = {{A Scalable Approach to Network Enabled Servers}},
Volume = {2400},
Year = {2002}}
@inproceedings{DS01a,
Address = {San Francisco},
Author = {Desprez, F. and Suter, F.},
Booktitle = {In proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS'01)},
Keyword = {parallel linear algebra, mixed parallelism},
Month = APR,
Title = {{Mixed Parallel Implementations of the Top Level of Strassen and Winograd Matrix Multiplication Algorithms}},
Year = {2001}}
@inproceedings{DQS01b,
Address = {Las Vegas},
Author = {Desprez, F. and Quinson, M. and Suter, F.},
Booktitle = {International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001)},
Editor = {H.R. Arabnia},
Keyword = {Grid computing, performance evaluation, Network Enabled Servers},
Note = {ISBN: 1-892512-69-6},
Publisher = {CSREA Press},
Title = {{Dynamic Performance Modeling for Network Enabled Solvers in a Metacomputing Environment}},
Volume = {III},
Year = {2001}}
@inproceedings{FFJ+00,
Address = {Neuch{\^a}tel, Switzerland},
Author = {Desprez, F. and Fleury, E. and Jeannot, E. and Nicod, J.-M. and Suter, F.},
Booktitle = {Parallel Matrix Algorithms and Applications},
Keyword = {Scilab, grid computing, parallel linear algebra, Network Enabled Servers},
Month = AUG,
Organization = {SIAM},
Title = {{Computational Servers in a Metacomputing Environment}},
Year = {2000}}
@inproceedings{DD00,
Address = {Porto},
Author = {Desprez, F. and Domas, S.},
Booktitle = {4th international meeting VECPAR 2000},
Key = {DD00},
Keyword = {macro-pipelining, parallel linear algebra},
Month = JUN,
Pages = {675-688},
Title = {{Efficient Pipelining of Level 3 BLAS Routines}},
Volume = {3},
Year = {2000}}
@TechReport{CDL00,
author = "Chaussumier, F. and Desprez, F. and Prylli, L.",
title = "{Asynchronous Communications in MPI - the BIP/Myrinet Approach}",
institution = "INRIA",
year = 2000,
number = "RR-3960",
keyword = {communication overlap}
}
@TechReport{DJ01,
author = {Desprez, F. and Jeannot, E.},
title = "{Addind Data Persistance and Redistribution to Netsolve}",
institution = {LIP},
year = 2001,
type = {Research Report},
number = {RR2001-39},
address = {ENS Lyon}
}
@TechReport{CCC+01b,
author = {Caron, E. and Chaumette, S. and Contassot-Vivier, S. and Desprez, F. and Fleury, E. and Gomez, C. and Goursat, M. and
Jeannot, E. and Lazure, D. and Lombard, F. and Nicod, J.M. and Philippe, L. and Quinson, M. and Ramet, P. and Roman, J. and
Rubi, F. and Steer, S. and Suter, F. and Utard, G.},
title = "{Scilab to Scilab//: the OURAGAN Project}",
institution = {LIP ENS Lyon},
year = 2001,
number = {RR2001-24},
note = {Also INRIA Research Report RR-4203},
keyword = {Scilab, grid computing}
}
@TechReport{DQS01b,
author = {Desprez, F. and Quinson, M. and Suter, F.},
title = "{Dynamic Performance Forecasting for Network-Enabled Servers in a Heterogeneous Environment}",
institution = {LIP ENS Lyon},
year = 2001,
month = nov,
number = {RR2001-40},
note = {Also available as INRIA Research Report RR-4320},
postscript = "ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2001/RR2001-40.ps.Z",
type = {Research report},
keyword = {performance evaluation, grid computing}
}
@TechReport{ DQSO1c,
author = {Desprez, Frédéric and Quinson, Martin and Suter,
Frédéric},
title = {{Dynamic Performance Forecasting for Network Enabled
Servers in a Heterogeneous Environment}},
institution = {Institut National de Recherche en Informatique et en
Automatique (INRIA)},
year = 2001,
number = {RR-4320},
month = nov,
note = {Also available as LIP Research Report 2001-40},
postscript = "ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4320.ps.gz",
type = {Research report},
keywords = {Performance Forecasting, FAST}
}
@TechReport{CCC+02,
author = {Caron, Eddy and Combes, Philippe and Contassot-Vivier, Sylvain and Desprez, Frédéric and Lombard, Frédéric and Nicod, Jean-Marc and Quinson, Martin and Suter, Frédéric},
title = {{A Scalable Approach to Network Enabled Servers}},
institution = {Laboratoire de l'Informatique du Parallélisme (LIP)},
year = 2002,
number = {RR2002-21},
month = {May},
note = {Also INRIA Research Report RR-????},
postscript = "ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-21.ps.gz",
KEYWORDS ={Metacomputing, DIET}
}
@TechReport{DS02,
author = {Desprez, Frédéric and Suter, Frédéric},
title = {Impact of Mixed-Parallelism on Parallel Implementations of Strassen and Winograd Matrix Multiplication Algorithms},
institution = {Laboratoire de l'Informatique du Parallélisme (LIP)},
year = 2002,
number = {RR2002-24},
month = {June},
postscript = "ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-24.ps.gz",
note = {Also INRIA Research Report RR-4482},
KEYWORDS = {Mixed Parallelism}
}
@TechReport{CDPV03b,
author = {Caron, Eddy and Desprez, Frédéric and Petit, Franck and
Villain, Vincent},
title = {{A Hierarchical Resource Reservation Algorithm for Network
Enabled Servers}},
institution = {Laboratoire de l'Informatique du Parallélisme (LIP)},
year = 2003,
number = {RR2003-03},
month = {January},
note = {Also available as INRIA Research Report RR-4701},
postscript =
"ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2003/RR2003-03.ps.gz",
KEYWORDS ={Metacomputing, DIET, Scheduling}
}
@TechReport{CDPV03c,
author = {Caron, Eddy and Desprez, Frédéric and Petit, Franck and
Villain, Vincent},
title = {{A Hierarchical Resource Reservation Algorithm for Network
Enabled Servers}},
institution = {Institut National de Recherche en Informatique et en
Automatique (INRIA)},
year = 2003,
number = {RR-4701},
month = {January},
note = {Also available as LIP Research Report RR2003-03},
postscript =
"ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4701.ps.gz",
KEYWORDS ={Metacomputing, DIET}
}
@TechReport{CDPV03b,
author = {Caron, Eddy and Desprez, Frédéric and Petit, Franck and
Villain, Vincent},
title = {{A Hierarchical Resource Reservation Algorithm for Network
Enabled Servers}},
institution = {Laboratoire de l'Informatique du Parallélisme (LIP)},
year = 2003,
number = {RR2003-03},
month = {January},
note = {Also available as INRIA Research Report RR-4701},
postscript =
"ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2003/RR2003-03.ps.gz",
KEYWORDS ={Metacomputing, DIET, Scheduling}
}
@TechReport{CDPV03c,
author = {Caron, Eddy and Desprez, Frédéric and Petit, Franck and
Villain, Vincent},
title = {{A Hierarchical Resource Reservation Algorithm for Network
Enabled Servers}},
institution = {Institut National de Recherche en Informatique et en
Automatique (INRIA)},
year = 2003,
number = {RR-4701},
month = {January},
note = {Also available as LIP Research Report RR2003-03},
postscript =
"ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4701.ps.gz",
KEYWORDS ={Metacomputing, DIET}
}
@TechReport{CDPV03d,
author = {Caron, Eddy and Desprez, Frédéric and Petit, Franck and Villain, Vincent},
title = {{A Hierarchical Resource Reservation Algorithm for Network Enabled Servers}},
year = 2003,
number = {LaRIA-2003-14},
month = {November},
note = {Also available as INRIA Research Report RR-4701 and LIP Research Report RR2003-03},
KEYWORDS ={Metacomputing, DIET}
}
@TechReport{CCD04b,
author = {Caron, Eddy and Chouhan, Pushpinder-Kaur and Desprez, Frédéric},
title = {Deadline scheduling with Priority for client-server systems},
institution = {INRIA},
year = 2004,
number = {RR-5335},
month = oct,
note = {Also available as LIP Research Report 2004-33},
postscript = "ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5335.ps.gz",
pdf = "ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5335.pdf",
type = {Research report},
}
@TechReport{CCD04a,
author = {Caron, Eddy and Chouhan, Pushpinder-Kaur and Desprez, Frédéric},
title = {Deadline scheduling with Priority for client-server systems},
institution = {Laboratoire de l'Informatique du Parallélisme (LIP)},
year = 2004,
number = {2004-33},
month = jul,
note = {Also available as INRIA Research Report RR-5335},
postscript = "http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2004/RR2004-33.ps.gz",
type = {Research report},
}
@TechReport{CDPT04a,
author = {Caron, Eddy and Desprez, Frédéric and Petit, Franck and Tedeschi, Cédric},
title = {{Resource Localization Using Peer-To-Peer Technology for Network Enabled Servers}},
institution = {Laboratoire de l'Informatique du Parallélisme (LIP)},
year = 2004,
number = {2004-55},
month = dec,
pdf = "ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2004/RR2004-55.pdf",
type = {Research report},
keywords = {Grid Computing, DIET, P2P}
}
@TechReport{DD05,
author = {Dail, H. and Desprez, F.},
title = {Experiences with hierarchical request flow management
for Network-Enabled Server Environments},
institution = {Laboratoire de l'Informatique du Parallélisme (LIP)},
year = {2005},
month = {February},
number = {RR-2005-07},
pdf = "http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2005/RR2005-07.pdf",
type = {Research report},
keywords = {DIET, Scheduling, Window, Hierarchical}
}
@TechReport{RRDV05,
author = {Desprez, F. and Vernois, A.},
institution = {LIP},
title = "{Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid}",
number = {RR2005-01},
month = {jan},
year = {2005}
}
@TechReport{ TechReportRR-Laboratoire-RR-2006-14,
author = {Raphael Bolze, Eddy Caron, Frederic Desprez, Georg Hoesch, and
Cyril Pontvieux},
institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
month = apr,
note = {Also available as INRIA Research Report 5879},
number = {RR-2006-14},
pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-14.pdf},
title = {A Monitoring and Visualization Tool and Its Application for a
Network Enabled Server Platform},
year = 2006
}
@TechReport{ TechReportRR-Institut-RR-5879,
author = {Raphael Bolze, Eddy Caron, Frederic Desprez, Georg Hoesch, and
Cyril Pontvieux},
institution = {Institut National de Recherche en Informatique et en
Automatique (INRIA)},
month = apr,
note = {Also available as LIP Research Report 2006-14},
number = {RR-5879},
pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5879.pdf},
postscript =
{ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5879.ps.gz},
title = {A Monitoring and Visualization Tool and Its Application for a
Network Enabled Server Platform},
year = 2006
}
@TechReport{Caron-Desprez,
author = {Caron, Eddy and Desprez, Frédéric and Jan, Mathieu and Antoniu, Gabriel},
title = {Towards a Transparent Data Access Model for the GridRPC Paradigm},
year = {2006},
month = {11},
institution = {INRIA},
number = {6009},
type = {Research Report},
url= {https://hal.inria.fr/inria-00110967},
}
@TechReport{Amar-Bolze06,
Author = {Amar, Abelkader and Bolze, Rapha{\"e}l and Bouteiller, Aur{\'e}lien an\d Chis, Andr{\'e}ea and Caniou, Yves and Caron, Eddy and Chouhan, Pushpinder Kau\r and Le Mahec, Ga{\"e}l and Dail, Holly and Depardon, Benjamin and Desprez, Fr{\\'e}d{\'e}ric and Gay, Jean-S{\'e}bastien and Su, Alan},
title = {DIET: New Developments and Recent Results},
year = {2006},
month = {11},
institution = {INRIA},
number = {6027},
type = {Research Report},
pages = {24 p.},
url= {https://hal.inria.fr/inria-00115569},
Note = {Also available as LIP Research Report 2006-31},
Keywords = {Grid Computing, Network Enabled Servers, Client-servers computing, D\IET},
Abstract = {Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classic client-server or Remote Procedure Call (RPC) paradigm. Network Enabled Servers (NES) implement this model also called GridRPC. Clients submit computation requests to a scheduler whose goal is to find a server available on the grid. The aim of this paper is to give an overview of an NES mi\ddleware developed in the GRAAL team called DIET and to describe recent developments. DIET (Distributed Interactive Engineering Toolbox) is a hierarchical set of components used for the development of applications based on computational servers on the grid.}
}
@techreport{RR-DIET-2006-31,
Author = {Amar, Abelkader and Bolze, Rapha{\"e}l and Bouteiller, Aur{\'e}lien an\d Chis, Andr{\'e}ea and Caniou, Yves and Caron, Eddy and Chouhan, Pushpinder Kau\r and Le Mahec, Ga{\"e}l and Dail, Holly and Depardon, Benjamin and Desprez, Fr{\\'e}d{\'e}ric and Gay, Jean-S{\'e}bastien and Su, Alan},
Date-Added = {2006-11-21 22:59:36 +0100},
Date-Modified = {2006-11-21 22:59:36 +0100},
Institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
Keywords = {Grid Computing, Network Enabled Servers, Client-servers computing, D\IET},
Month = oct,
Note = {Also available as INRIA Research Report 6027},
Number = {RR2006-31},
Title = {DIET: New Developments and Recent Results},
Url = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-31.pdf},
Year = 2006,
Abstract = {Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classic client-server or Remote Procedure Call (RPC) paradigm. Network Enabled Servers (NES) implement this model also called GridRPC. Clients submit computation requests to a scheduler whose goal is to find a server available on the grid. The aim of this paper is to give an overview of an NES mi\ddleware developed in the GRAAL team called DIET and to describe recent developments. DIET (Distributed Interactive Engineering Toolbox) is a hierarchical set of components used for the development of applications based on computational servers on the grid.}
}
@techreport{RR-TPLD-2006-34,
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Fourdrignier, Charles and Petit, Franck and Tedeschi, C{\'e}dric},
Title = {A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems},
Institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
Keywords = {Fault tolerance, peer-to-peer, prefix trees},
Month = oct,
Note = {Also available as INRIA Research Report 6029},
Number = {RR2006-34},
Pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-34.pdf},
Year = 2006,
Abstract = {Facing the limits of traditional tools of resource management within computational grids (related to scale, dynamicity, etc. of the platforms newly considered), new approaches, based on peer-to-peer technologies are emerging. The resource discovery and in particular the service discovery is concerned by this evolution. Among the solutions, a promising one is the indexing of resources using trie structures and more particularly prefix trees. The major advantages of trie-structured approaches is the capability to support search queries on ranges of values with a latency growing logarithmically in the number of nodes in the trie. Those techniques are easy to extend to multicriteria searches. One drawback of using tries is its inherent poor robustness in a dynamic environment, where nodes join and leave the network, leading to the split of the tree into a forest, which results in the impossibility to route requests. Within most recent approaches, the fault-tolerance is a prevention mechanism, often replication-based. The replication can be costly in term of resources required. In this paper, we propose a fault-tolerance protocol that reconnects subtrees a posteriori, after crashes, to have again a connected graph and then reorder the nodes to rebuild a consistent tree.}
}
@techreport{RR-TPLD-6029,
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Fourdrignier, Charles and Petit, Franck and Tedeschi, C{\'e}dric},
Title = {A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems},
Institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
Keywords = {Fault tolerance, peer-to-peer, prefix trees},
Month = oct,
Note = {Also available as LIP Research Report 2001-34},
Number = {RR6029},
Url = {https://hal.inria.fr/inria-00115997},
Year = 2006,
Abstract = {Facing the limits of traditional tools of resource management within computational grids (related to scale, dynamicity, etc. of the platforms newly considered), new approaches, based on peer-to-peer technologies are emerging. The resource discovery and in particular the service discovery is concerned by this evolution. Among the solutions, a promising one is the indexing of resources using trie structures and more particularly prefix trees. The major advantages of trie-structured approaches is the capability to support search queries on ranges of values with a latency growing logarithmically in the number of nodes in the trie. Those techniques are easy to extend to multicriteria searches. One drawback of using tries is its inherent poor robustness in a dynamic environment, where nodes join and leave the network, leading to the split of the tree into a forest, which results in the impossibility to route requests. Within most recent approaches, the fault-tolerance is a prevention mechanism, often replication-based. The replication can be costly in term of resources required. In this paper, we propose a fault-tolerance protocol that reconnects subtrees a posteriori, after crashes, to have again a connected graph and then reorder the nodes to rebuild a consistent tree.},
}
@techreport{RR-DIETJUXMEM-PI1823,
Author = {Antoniu, Gabriel and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Jan, Mathieu},
Title = {Towards a Transparent Data Access Model for the GridRPC Paradigm},
Institution = {IRISA},
Keywords = {GridRPC, Data Sharing, Persistency, JUXMEM, DIET},
Month = nov,
Note = {Also available as INRIA Research Report 6009},
Number = {PI1823},
Url = {http://www.irisa.fr/centredoc/publis/PI/2006/irisapublication.2006-11-02.8327047788},
Year = 2006,
Abstract = {As grids become more and more attractive for solving complex problems with high computational and storage requirements, the need for adequate grid programming models is considerable. To this purpose, the GridRPC model has been proposed as a grid version of the classical RPC paradigm, with the goal to build NES (Network-Enabled Server) environments. Paradoxically enough, in this model, data management has not been defined and is now explicitly left at the user's charge. The contribution of this paper is to enhance data management in NES by introducing a transparent data access model, available through the concept of grid data-sharing service. Data management (persistent storage, transfer, consistent replication) is totally delegated to the service, whereas the applications simply access shared data via global identifiers. We illustrate our approach using the DIET GridRPC middleware and the JUXMEM data-sharing service. Experiments performed on the Grid'5000 testbed demonstrate the benefits of the proposed approach.},
}
@techreport{RR-DIETJUXMEM-6009,
Author = {Antoniu, Gabriel and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Jan, Mathieu},
Institution = {INRIA},
Keywords = {GridRPC, Data Sharing, Persistency, JUXMEM, DIET},
Month = nov,
Note = {Also available as IRISA Research Report PI1823},
Number = {RR-6009},
Title = {Towards a Transparent Data Access Model for the GridRPC Paradigm},
Url = {https://hal.inria.fr/inria-00110902},
Year = 2006,
Abstract = {As grids become more and more attractive for solving complex problems with high computational and storage requirements, the need for adequate grid programming models is considerable. To this purpose, the GridRPC model has been proposed as a grid version of the classical RPC paradigm, with the goal to build NES (Network-Enabled Server) environments. Paradoxically enough, in this model, data management has not been defined and is now explicitly left at the user's charge. The contribution of this paper is to enhance data management in NES by introducing a transparent data access model, available through the concept of grid data-sharing service. Data management (persistent storage, transfer, consistent replication) is totally delegated to the service, whereas the applications simply access shared data via global identifiers. We illustrate our approach using the DIET GridRPC middleware and the JUXMEM data-sharing service. Experiments performed on the Grid'5000 testbed demonstrate the benefits of the proposed approach.},
}
@techreport{RR-TPLD-6297,
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Petit, Franck and Tedeschi, C{\'e}dric},
Title = {Snap-stabilizing Prefix Tree for Peer-to-peer Systems},
Institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
Number = {RR-6297},
Month = september,
Note = {Also available as LIP Research Report 2007-xx},
Keywords = {TPLD, Peer-to-peer systems, Fault-tolerance, Self-stabilization, Snap-stabilization, Grid computing},
Url = {http://hal.inria.fr/inria-00173050/fr/},
Year = 2007,
Abstract = {Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Prefix Trees appear to be among promising ways in the design of distributed data structures indexing resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. In this paper, we provide the first snap-stabilizing protocol for trie construction. We design particular tries called Proper Greatest Common Prefix (PGCP) Tree. The proposed algorithm arranges the n label values stored in the tree, in average, in O(h+h') rounds, where h and h' are the initial and final heights of the tree, respectively. In the worst case, the algorithm requires an O(n) extra space on each node, O(n) rounds and O(n^2) actions. However, simulations show that, using relevant data sets, this worst case is far from being reached and confirm the average complexities, making this algorithm efficient in practice.}
}
@Manual{ Man-Tanimura.TSCANTD_07,
author = {Tanimura, Yusuke and Seymour, Keith and Caron, Eddy and Amar, Abelkader and Nakada, Hidemoto and Tanaka, Yoshio and Desprez, Fr\'ed\'eric},
editor = {GridRPC-WG},
keywords = {DIET},
month = may,
note = {OGF Reference: GFD.102},
organization = {Open Grid Forum},
title = {Interoperability Testing for The {GridRPC} API Specification},
url = {http://www.ogf.org/documents/GFD.102.pdf},
year = {2007}
}
@techreport{RR-TPLD-2008-18,
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
Institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
Month = jun,
Note = {Also available as INRIA Research Report 6557},
Number = {2008-18},
Title = {{Efficiency of Tree-Structured Peer-to-Peer Service Discovery Systems}},
Url = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2008/RR2008-18.pdf},
Year = 2008}
@techreport{RR-TPLD-6557,
Abstract = {The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design of many peer-to-peer fashioned approaches. More specifically, the need for flexibility and complexity in the service discovery has seen the emergence of a new kind of overlays, based on tries, also known as lexicographic trees. Although these overlays are efficient and well designed, they require a costly maintenance and do not accurately take into account the heterogeneity of nodes and the changing popularity of the services requested by users. In this paper, we focus on reducing the cost of the maintenance of a particular architecture, based on a dynamic prefix tree, while enhancing it with some load balancing techniques that dynamically adapt the load of the nodes in order to maximize the throughput of the system. The algorithms developed couple a self-organizing prefix tree overlay with load balancing techniques inspired by similar previous works undertaken for distributed hash tables. After some simulation results showing how our load balancing heuristics perform in such an overlay and compare to other heuristics, we provide a fair comparison of this architecture and similar overlays recently proposed.},
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
Institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
Keywords = {Service discovery, computational grids, peer-to-peer, prefix trees, mapping, load balancing, LEGO},
Month = jun,
Note = {Also available as LIP Research Report 2008-18},
Number = {RR-6557},
Read = {Oui},
Title = {Efficiency of Tree-structured Peer-to-peer Service Discovery Systems},
Url = {http://hal.inria.fr/inria-00287800/fr/},
Year = 2008,
Bdsk-Url-1 = {https://hal.inria.fr/inria-00116111}}
@techreport{RR-TPLD-2008-18,
Abstract = {The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design of many peer-to-peer fashioned approaches. More specifically, the need for flexibility and complexity in the service discovery has seen the emergence of a new kind of overlays, based on tries, also known as lexicographic trees. Although these overlays are efficient and well designed, they require a costly maintenance and do not accurately take into account the heterogeneity of nodes and the changing popularity of the services requested by users. In this paper, we focus on reducing the cost of the maintenance of a particular architecture, based on a dynamic prefix tree, while enhancing it with some load balancing techniques that dynamically adapt the load of the nodes in order to maximize the throughput of the system. The algorithms developed couple a self-organizing prefix tree overlay with load balancing techniques inspired by similar previous works undertaken for distributed hash tables. After some simulation results showing how our load balancing heuristics perform in such an overlay and compare to other heuristics, we provide a fair comparison of this architecture and similar overlays recently proposed.},
Author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
Institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
Keywords = {Service discovery, computational grids, peer-to-peer, prefix trees, mapping, load balancing, LEGO},
Month = june,
Note = {Also available as INRIA Research Report 6557},
Number = {RR2008-18},
Pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2008/RR2008-18.pdf},
Title = {Efficiency of Tree-Structured Peer-to-peer Service Discovery Systems},
Year = 2008}
@techreport{RR-6566,
Abstract = {The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalability and how middleware services can be mapped on the available resources. Optimizing deployment is a difficult problem with no existing general solutions. In this paper, we address the following problem: how to perform out an adapted deployment for a hierarchy of servers and resource brokers on a heterogeneous system? Our objective is to generate a best platform from the available nodes so as to fulfill the clients demands. However, finding the best deployment among heterogeneous resources is a hard problem since it is close to find the best broadcast tree in a general graph, which is known to be NP-complete. Thus, in this paper, we present a heuristic for middleware deployment on heterogeneous resources. We apply our heuristic to automatically deploy a distributed Problem Solving Environment on a large scale grid. We present experiments comparing the automatically generated deployment against a number of other reasonable deployments.},
Author = {Caron, Eddy and Chouhan, Pushpinder Kaur and Desprez, Fr{\'e}d{\'e}ric},
Institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
Keywords = {Deployment, ASP, Grid computing, DIET, LEGO},
Month = june,
Note = {Also available as LIP Research Report 2008-23},
Number = {6566},
Title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
Year = 2008
}
@techreport{RR-2008-23,
Abstract = {The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalability and how middleware services can be mapped on the available resources. Optimizing deployment is a difficult problem with no existing general solutions. In this paper, we address the following problem: how to perform out an adapted deployment for a hierarchy of servers and resource brokers on a heterogeneous system? Our objective is to generate a best platform from the available nodes so as to fulfill the clients demands. However, finding the best deployment among heterogeneous resources is a hard problem since it is close to find the best broadcast tree in a general graph, which is known to be NP-complete. Thus, in this paper, we present a heuristic for middleware deployment on heterogeneous resources. We apply our heuristic to automatically deploy a distributed Problem Solving Environment on a large scale grid. We present experiments comparing the automatically generated deployment against a number of other reasonable deployments.},
Author = {Caron, Eddy and Chouhan, Pushpinder Kaur and Desprez, Fr{\'e}d{\'e}ric},
Institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
Keywords = {Deployment, ASP, Grid computing, DIET, LEGO},
Month = june,
Note = {Also available as INRIA Research Report 6566},
Number = {RR-2008-23},
Title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
Year = 2008
}
@TechReport{rr2bis,
author = {Caniou, Yves and Caron, Eddy andhttp://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2009/RR2009-05.pdf 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)},
month = February,
note = {Also available as LIP Research Report RR2009-05},
annote = {http://hal.inria.fr/inria-00359972/fr/},
number = {RR-6836},
title = {Ocean-Atmosphere Application Scheduling within DIET},
year = 2009
}
@TechReport{rr2,
author = {Caniou, Yves and Caron, Eddy and Charrier, Ghislain and
Desprez, Fr{\'e}d{\'e}ric and Maisonnave, Eric and Pichon, Vincent},
institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
month = February,
note = {Also available as INRIA Research Report RR-6836},
annote = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2009/RR2009-05.pdf},
number = {RR2009-05},
title = {Ocean-Atmosphere Application Scheduling within DIET},
year = 2009
}
@techreport{BLAIZOT:2009:INRIA-00431637:1,
title = { {C}osmological {S}imulations on a {G}rid of {C}omputers},
author = {{B}laizot, {J}eremy and {C}aron, {E}ddy and {C}ourtois, {H}{\'e}l{\`e}ne and {D}epardon, {B}enjamin and {D}esprez, {F}r{\'e}d{\'e}ric},
abstract = {{T}he work presented in this paper aims at restricting the input parameter values of the semi-analytical model used in {G}alics and {M}o{M}a{F}, so as to derive which parameters influence the most the results, e.g., star forma- tion, feedback and halo recycling efficiencies, etc. {O}ur approach is to proceed empirically: we run lots of simulations and derive the correct ranges of values. {T}he computation time needed is so large, that we need to run on a grid of com- puters. {H}ence, we model {G}alics and {M}o{M}a{F} execution time and output files size, and run the simulation using a grid middleware: {D}iet. {A}ll the complexity of accessing resources, scheduling simulations and managing data is harnessed by {D}iet and hidden behind a web portal accessible to the users.},
keywords = {{C}osmology; {N}-body simulations; {P}arallel computing; {L}ocal uni- verse; {M}iddleware; {G}rid-{RPC}},
language = {{A}nglais},
affiliation = {{C}entre de {R}echerche {A}strophysique de {L}yon - {CRAL} - {CNRS} : {UMR}5574 - {INSU} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {\'E}cole normale sup{\'e}rieure de {L}yon - {ENS} {L}yon - {L}aboratoire de l'{I}nformatique du {P}arall{\'e}lisme - {LIP} - {INRIA} - {CNRS} : {UMR}5668 - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {\'E}cole normale sup{\'e}rieure de {L}yon - {ENS} {L}yon - {I}nstitut de {P}hysique {N}ucl{\'e}aire de {L}yon - {IPNL} - {CNRS} : {UMR}5822 - {IN}2{P}3 - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {GRAAL} - {INRIA} {R}h{\^o}ne-{A}lpes / {LIP} {L}aboratoire de l'{I}nformatique du {P}arall{\'e}lisme - {CNRS} : {UMR}5668 - {INRIA} - {\'E}cole normale sup{\'e}rieure de {L}yon - {ENS} {L}yon - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {L}aboratoire d'informatique du {P}arall{\'e}lisme },
pages = {15 },
type = {Research Report},
institution = {INRIA},
number = {{RR}-7093},
year = {2009},
URL = {http://hal.inria.fr/inria-00431637/en/},
}
@techreport{Depardon:2009rt,
Abstract = {{T}he work presented in this paper aims at restricting the input parameter values of the semi-analytical model used in {G}alics and {M}o{M}a{F}, so as to derive which parameters influence the most the results, e.g., star formation, feedback and halo recycling efficiencies, etc. {O}ur approach is to proceed empirically: we run lots of simulations and derive the correct ranges of values. {T}he computation time needed is so large, that we need to run on a grid of computers. {H}ence, we model {G}alics and {M}o{M}a{F} execution time and output files size, and run the simulation using a grid middleware: {D}iet. {A}ll the complexity of accessing resources, scheduling simulations and managing data is harnessed by {D}iet and hidden behind a web portal accessible to the users.},
Affiliation = {{L}aboratoire de l'{I}nformatique du {P}arall{\'e}lisme - {LIP} - {INRIA} - {CNRS} : {UMR}5668 - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {\'E}cole normale sup{\'e}rieure de {L}yon - {ENS} {L}yon - {I}nstitut de {P}hysique {N}ucl{\'e}aire de {L}yon - {IPNL} - {CNRS} : {UMR}5822 - {IN}2{P}3 - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {C}entre de {R}echerche {A}strophysique de {L}yon - {CRAL} - {CNRS} : {UMR}5574 - {INSU} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {\'E}cole normale sup{\'e}rieure de {L}yon - {ENS} {L}yon},
Author = {Depardon, Benjamin and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Blaizot, J{\'e}r{\'e}my and Courtois, H{\'e}l{\`e}ne},
Institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
Keywords = {Cosmology; N-body simulations; Parallel computing; Local universe; Middleware; Grid-RPC},
Language = {{A}nglais},
Month = {November},
Note = {Also available as INRIA Research Report RR-7093},
Number = {RRLIP2009-31},
Title = {Cosmological Simulations on a Grid of Computers},
Url = {http://prunel.ccsd.cnrs.fr/ensl-00431770/en/},
Year = {2009}
}