-
Kamer Kaya,
Bora Uçar,
and Cevdet Aykanat.
Adapting iterative-improvement heuristics for scheduling file-sharing tasks on heterogeneous platforms.
In F. Xhafa and A. Abraham, editors,Metaheuristics for Scheduling in Distributed Computing Environments,
number 146 of Studies in Computational Intelligence,
chapter 5,
pages 121--151.
Springer-Verlag Berlin Heidelberg,
2008.
@InCollection{ InCollectionKaya.KUA_08,
author = {Kamer Kaya and Bora U\c{c}ar and Cevdet Aykanat},
title = {Adapting iterative-improvement heuristics for scheduling file-sharing tasks on heterogeneous platforms},
booktitle = {Metaheuristics for Scheduling in Distributed Computing Environments},
pages = {121--151},
publisher = {Springer-Verlag Berlin Heidelberg},
year = 2008,
editor = {F. Xhafa and A. Abraham},
number = 146,
series = {Studies in Computational Intelligence},
chapter = 5
}
-
Emmanuel Agullo,
Abdou Guermouche,
and Jean-Yves L'Excellent.
A Parallel Out-of-core Multifrontal Method: Storage of Factors on Disk and Analysis of Models for an Out-of-core Active Memory.
Parallel Computing, Special Issue on Parallel Matrix Algorithms,
34(6-8):296-317,
2008.
@Article{ ArticleAgullo.AGL_PCSIPMA08,
author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
title = {A Parallel Out-of-core Multifrontal Method: Storage of Factors on Disk and Analysis of Models for an Out-of-core Active Memory},
journal = {Parallel Computing, Special Issue on Parallel Matrix Algorithms},
year = {2008},
volume = {34},
number = {6-8},
pages = {296-317}
}
-
Abelkader Amar,
Raphaël Bolze,
Yves Caniou,
Eddy Caron,
Benjamin Depardon,
Frédéric Desprez,
Jean-Sébastien Gay,
Gaël Le Mahec,
and David Loureiro.
Tunable Scheduling in a GridRPC Framework.
Concurrency and Computation: Practice and Experience,
20(9):1051--1069,
2008.
Keywords:
Scheduling,
DIET,
LEGO.
@Article{ ArticleAmar.ABCCDDGL-ML_CCPE08,
author = {Amar, Abelkader and Bolze, Rapha{\"e}l and Caniou, Yves and Caron, Eddy and Depardon, Benjamin and Desprez, Fr{\'e}d{\'e}ric and Gay, Jean-S{\'e}bastien and Le Mahec, Ga{\"e}l and Loureiro, David},
journal = {Concurrency and Computation: Practice and Experience},
keywords = {Scheduling, DIET, LEGO},
number = {9},
pages = {1051--1069},
title = {Tunable Scheduling in a {GridRPC} Framework},
volume = {20},
year = 2008
}
-
Cevdet Aykanat,
Berkant B. Cambazoglu,
and Bora Uçar.
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices.
Journal of Parallel and Distributed Computing,
68:609--625,
2008.
@Article{ ArticleAykanat.ACU_JPDC08,
author = {Cevdet Aykanat and Berkant B. Cambazoglu and Bora U\c{c}ar},
journal = {Journal of Parallel and Distributed Computing},
pages = {609--625},
title = {Multi-level direct {K}-way hypergraph partitioning with multiple constraints and fixed vertices},
volume = {68},
year = 2008
}
-
Olivier Beaumont,
Larry Carter,
Jeanne Ferrante,
Arnaud Legrand,
Loris Marchal,
and Yves Robert.
Centralized versus distributed schedulers for multiple bag-of-task applications.
IEEE Trans. Parallel Distributed Systems,
19(5):698-709,
2008.
@Article{ ArticleBeaumont.BCFLMR_ITPDS08,
author = {Olivier Beaumont and Larry Carter and Jeanne Ferrante and Arnaud Legrand and Loris Marchal and Yves Robert},
journal = {IEEE Trans. Parallel Distributed Systems},
title = {Centralized versus distributed schedulers for multiple bag-of-task applications},
volume = {19},
number = {5},
pages = {698-709},
year = {2008}
}
-
Anne Benoit,
Veronika Rehn-Sonigo,
and Yves Robert.
Replica placement and access policies in tree networks.
IEEE Trans. Parallel Distributed Systems,
19(12):1614-1627,
2008.
@Article{ ArticleBenoit.BRR_ITPDS08,
author = {Anne Benoit and Veronika Rehn-Sonigo and Yves Robert},
journal = {IEEE Trans. Parallel Distributed Systems},
title = {Replica placement and access policies in tree networks},
volume = {19},
number = {12},
pages = {1614-1627},
year = {2008}
}
-
Anne Benoit and Yves Robert.
Mapping pipeline skeletons onto heterogeneous platforms.
J. Parallel and Distributed Computing,
68(6):790-808,
2008.
@Article{ ArticleBenoit.BR_JPDC08,
author = {Anne Benoit and Yves Robert},
journal = {J. Parallel and Distributed Computing},
title = {Mapping pipeline skeletons onto heterogeneous platforms},
year = {2008},
publisher = {Academic Press},
volume = {68},
number = {6},
pages = {790-808}
}
-
Eddy Caron,
Andréea Chis,
Frédéric Desprez,
and Alan Su.
Design of plug-in schedulers for a GridRPC environment.
Future Generation Computer Systems,
24(1):46-57,
January 2008.
Keywords:
Scheduling,
DIET,
LEGO.
@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},
month = jan,
number = 1,
pages = {46-57},
title = {Design of plug-in schedulers for a {GridRPC} environment},
volume = 24,
year = 2008
}
-
Jack Dongarra,
Jean-François Pineau,
Yves Robert,
Zhiao Shi,
and Frédéric Vivien.
Revisiting Matrix Product on Master-Worker Platforms.
International Journal of Foundations of Computer Science,
19(6):1317-1336,
2008.
@Article{ ArticleDongarra.DPRSV_IJFCS08,
author = "Jack Dongarra and Jean-Fran\c{c}ois Pineau and Yves Robert and Zhiao Shi and Fr\'ed\'eric Vivien",
title = "Revisiting Matrix Product on Master-Worker Platforms",
journal = "International Journal of Foundations of Computer Science",
year = {2008},
volume = 19,
number = 6,
pages = {1317-1336}
}
-
Matthieu Gallet,
Yves Robert,
and Frédéric Vivien.
Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''.
J. Parallel and Distributed Computing,
68(7):1021-1031,
2008.
@Article{ ArticleGallet.GRV_JPDC08,
author = {Matthieu Gallet and Yves Robert and Fr\'ed\'eric Vivien},
journal = {J. Parallel and Distributed Computing},
title = {Comments on ``{D}esign and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''},
volume = {68},
number = {7},
pages = {1021-1031},
year = {2008}
}
-
Jean-Sébastien Gay and Yves Caniou.
Étude de la précision de Simbatch, une API pour la simulation de systèmes batch.
RSTI - Techniques et Sciences Informatiques,
27(3-4):373-394,
2008.
Keywords:
DIET,
LEGO.
@Article{ ArticleGay.GC_R-TSI08,
author = {Jean-S{\'e}bastien Gay and Yves Caniou},
title = {{\'E}tude de la pr{\'e}cision de {S}imbatch, une {API} pour la simulation de syst{\`e}mes batch},
journal = {RSTI - Techniques et Sciences Informatiques},
year = {2008},
volume = {27},
number = {3-4},
pages = {373-394},
keywords = {DIET, LEGO}
}
-
Arnaud Legrand,
Alan Su,
and Frédéric Vivien.
Minimizing the stretch when scheduling flows of divisible requests.
Journal of Scheduling,
11(5):381-404,
2008.
@Article{ ArticleLegrand.LSV_JS08,
author = {Arnaud Legrand and Alan Su and Fr\'ed\'eric Vivien},
title = {Minimizing the stretch when scheduling flows of divisible requests},
journal = {Journal of Scheduling},
year = 2008,
volume = 11,
number = 5,
pages = {381-404}
}
-
Jean-François Pineau,
Yves Robert,
and Frédéric Vivien.
The impact of heterogeneity on master-slave scheduling.
Parallel Computing,
34(3):158-176,
2008.
@Article{ ArticlePineau.PRV_PC08,
author = {Jean-Fran\c{c}ois Pineau and Yves Robert and Fr\'ed\'eric Vivien},
title = {The impact of heterogeneity on master-slave scheduling},
journal = {Parallel Computing},
year = {2008},
volume = {34},
number = {3},
pages = {158-176}
}
-
Kunal Agrawal,
Anne Benoit,
and Yves Robert.
Mapping linear workflows with computation/communication overlap.
In ICPADS'2008, the 14th IEEE International Conference on Parallel and Distributed Systems,
pages 195-202,
2008.
IEEE Computer Society Press.
@InProceedings{ InProceedingsAgrawal.ABR_08,
author = {Kunal Agrawal and Anne Benoit and Yves Robert},
booktitle = {{ICPADS'2008}, the 14th IEEE International Conference on Parallel and Distributed Systems},
publisher = {IEEE Computer Society Press},
title = {Mapping linear workflows with computation/communication overlap},
pages = {195-202},
year = {2008}
}
-
Emmanuel Agullo,
Abdou Guermouche,
and Jean-Yves L'Excellent.
On the I/O volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme.
In VECPAR'08 International Meeting on High Performance Computing for Computational Science,
volume 5336 of LNCS,
pages 328-335,
June 2008.
Springer-Verlag Berlin Heidelberg.
@InProceedings{ InProceedingsAgullo.AGL_08,
author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
title = {On the {I/O} volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme},
booktitle = {VECPAR'08 International Meeting on High Performance Computing for Computational Science},
pages = {328-335},
year = {2008},
month = jun,
series = {LNCS},
volume = {5336},
publisher = {Springer-Verlag Berlin Heidelberg}
}
-
Marco Aldinucci,
Hinde Bouziane,
Marco Danelutto,
and Christian Pérez.
Towards Software Component Assembly Language Enhanced with Workflows and Skeletons.
In Joint Workshop on Component-Based High Performance Computing and Component-Based Software Engineering and Software Architecture (CBHPC/COMPARCH 2008),
pages 678-690,
14-17 October 2008.
ACM.
Note: ISBN: 978-1-60558-311-2.
@InProceedings{ InProceedingsAldinucci.ABDP_08,
author = {Aldinucci, Marco and Bouziane, Hinde and Danelutto, Marco and P{\'e}rez, Christian},
title = {Towards Software Component Assembly Language Enhanced with Workflows and Skeletons},
year = {2008},
month = {14-17 October},
booktitle = {Joint Workshop on Component-Based High Performance Computing and Component-Based Software Engineering and Software Architecture (CBHPC/COMPARCH 2008)},
publisher = {ACM},
pages = { 678-690},
note = {ISBN: 978-1-60558-311-2}
}
-
Patrick R. Amestoy,
Iain S. Duff,
Daniel Ruiz,
and Bora Uçar.
A parallel matrix scaling algorithm.
In J. M. Palma,
P. R. Amestoy,
M. Daydé,
M. Mattoso,
and J. C. Lopes, editors,
High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference,
volume 5336 of Lecture Notes in Computer Science,
pages 301--313,
2008.
Springer Berlin / Heidelberg.
@InProceedings{ InProceedingsAmestoy.ADRU_08,
author = {Patrick R. Amestoy and Iain S. Duff and Daniel Ruiz and Bora U{\c{c}}ar},
booktitle = {High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference},
editor = {J. M. Palma and P. R. Amestoy and M. Dayd{{\'e}} and M. Mattoso and J. C. Lopes},
pages = {301--313},
publisher = {Springer Berlin / Heidelberg},
series = {Lecture Notes in Computer Science},
title = {A parallel matrix scaling algorithm},
volume = {5336},
year = {2008}
}
-
Hrachya Astsatryan,
Vladimir Sahakyan,
Yuri Shoukouryan,
Michel Daydé,
Aurélie Hurault,
Marc Pantel,
and Eddy Caron.
A Grid-Aware Web Interface with Advanced Service Trading for Linear Algebra Calculations.
In 8th International Meeting High Performance Computing for Computational Science (VECPAR'08),
Toulouse,
pages 106-113,
June 2008.
Keywords:
DIET,
LEGO.
@InProceedings{ InProceedingsAstsatryan.ASSDHPC_08,
address = {Toulouse},
author = {Astsatryan, Hrachya and Sahakyan, Vladimir and Shoukouryan, Yuri and Dayd{\'e}, Michel and Hurault, Aur{\'e}lie and Pantel, Marc and Caron, Eddy},
booktitle = {8th International Meeting High Performance Computing for Computational Science (VECPAR'08)},
keywords = {DIET, LEGO},
month = jun,
pages = {106-113},
title = {A Grid-Aware Web Interface with Advanced Service Trading for Linear Algebra Calculations},
year = 2008
}
-
Anne Benoit,
Mourad Hakem,
and Yves Robert.
Realistic models and efficient algorithms for fault tolerant scheduling on heterogeneous platforms.
In ICPP'2008, the 37th International Conference on Parallel Processing,
2008.
IEEE Computer Society Press.
@InProceedings{ InProceedingsBenoit.BHR_08*1,
author = {Anne Benoit and Mourad Hakem and Yves Robert},
booktitle = {{ICPP'2008}, the 37th International Conference on Parallel Processing},
publisher = {IEEE Computer Society Press},
title = {Realistic models and efficient algorithms for fault tolerant scheduling on heterogeneous platforms},
year = {2008}
}
-
Anne Benoit,
Mourad Hakem,
and Yves Robert.
Fault tolerant scheduling of precedence task graphs on heterogeneous platforms.
In 10th Workshop on Advances in Parallel and Distributed Computational Models APDCM 2008,
2008.
IEEE Computer Society Press.
@InProceedings{ InProceedingsBenoit.BHR_08,
author = {Anne Benoit and Mourad Hakem and Yves Robert},
booktitle = {10th Workshop on Advances in Parallel and Distributed Computational Models {APDCM 2008}},
publisher = {IEEE Computer Society Press},
title = {Fault tolerant scheduling of precedence task graphs on heterogeneous platforms},
year = {2008}
}
-
Anne Benoit,
Harald Kosch,
Veronika Rehn-Sonigo,
and Yves Robert.
Bi-criteria pipeline mappings for parallel image processing.
In ICCS'2008, the 8th International Conference on Computational Science,
volume 5101 of LNCS,
pages 215-225,
2008.
Springer Verlag.
@InProceedings{ InProceedingsBenoit.BKRR_08,
author = {Anne Benoit and Harald Kosch and Veronika Rehn-Sonigo and Yves Robert},
booktitle = {{ICCS'2008}, the 8th International Conference on Computational Science},
publisher = {Springer Verlag},
series = {LNCS},
volume = 5101,
pages = {215-225},
title = {Bi-criteria pipeline mappings for parallel image processing},
year = 2008
}
-
Anne Benoit,
Loris Marchal,
Jean-François Pineau,
Yves Robert,
and Frédéric Vivien.
Offline and online scheduling of concurrent bags-of-tasks on heterogeneous platforms.
In 10th Workshop on Advances in Parallel and Distributed Computational Models APDCM 2008,
2008.
IEEE Computer Society Press.
@InProceedings{ InProceedingsBenoit.BMPRV_08,
author = {Anne Benoit and Loris Marchal and Jean-Fran\c{c}ois Pineau and Yves Robert and Fr\'ed\'eric Vivien},
booktitle = {10th Workshop on Advances in Parallel and Distributed Computational Models {APDCM 2008}},
publisher = {IEEE Computer Society Press},
title = {Offline and online scheduling of concurrent bags-of-tasks on heterogeneous platforms},
year = {2008}
}
-
Anne Benoit,
Veronika Rehn-Sonigo,
and Yves Robert.
Optimizing latency and reliability of pipeline workflow applications.
In HCW'2008, the 17th Heterogeneous Computing Workshop,
2008.
IEEE Computer Society Press.
@InProceedings{ InProceedingsBenoit.BRR_08,
author = {Anne Benoit and Veronika Rehn-Sonigo and Yves Robert},
booktitle = {{HCW'2008}, the 17th Heterogeneous Computing Workshop},
publisher = {IEEE Computer Society Press},
title = {Optimizing latency and reliability of pipeline workflow applications},
year = {2008}
}
-
Viktor Bertis,
Raphaël Bolze,
Frédéric Desprez,
and Kevin Reed.
Large Scale Execution of a Bioinformatic Application on a Volunteer Grid.
In Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC08),
April 2008.
@InProceedings{ InProceedingsBertis.BBDR_08,
author = {Bertis, Viktor and Bolze, Rapha\"el and Desprez, Fr\'ed\'eric and Reed, Kevin},
title = {Large Scale Execution of a Bioinformatic Application on a Volunteer Grid},
booktitle = {Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC08)},
year = {2008},
month = {April}
}
-
Julien Bigot,
Hinde Bouziane,
Christian Pérez,
and Thierry Priol.
On Abstractions of Software Component Models for Scientific Applications.
In Proc. of the Abstractions for Distributed Systems workshop,
Las Palmas, Gran Canaria, Spain,
2008.
Keywords:
abstraction,
COMPONENT,
CORBA,
DATA SHARING,
DSM,
GRID,
parallelism,
programming.
@InProceedings{ InProceedingsBigot.BBPP_08,
author = {Bigot, Julien and Bouziane, Hinde and P{\'e}rez, Christian and Priol, Thierry},
title = {On Abstractions of Software Component Models for Scientific Applications},
year = {2008},
booktitle = {Proc. of the Abstractions for Distributed Systems workshop},
address = {Las Palmas, Gran Canaria, Spain},
keywords = {abstraction, COMPONENT, CORBA, DATA SHARING, DSM, GRID, parallelism, programming}
}
-
Hinde Lilia Bouziane,
Christian Pérez,
and Thierry Priol.
A Software Component Model with Spatial and Temporal Compositions for Grid infrastructures.
In Proc. 14th Intl. Euro-Par Conference (Euro-Par 08),
volume 5168 of Lecture Notes in Computer Science,
Las Palmas de Gran Canaria, Spain,
pages 698-708,
August 2008.
Springer Berlin / Heidelberg.
Keywords:
Component,
Grid computing,
Workflow,
LEGO.
@InProceedings{ InProceedingsBouziane.BPP_08,
author = {Bouziane, Hinde Lilia and P{\'e}rez, Christian and Priol, Thierry},
title = {A Software Component Model with Spatial and Temporal Compositions for Grid infrastructures},
year = 2008,
month = aug,
booktitle = {Proc. 14th Intl. Euro-Par Conference (Euro-Par 08)},
series = {Lecture Notes in Computer Science},
volume = 5168,
pages = {698-708},
address = {Las Palmas de Gran Canaria, Spain},
publisher = {Springer Berlin / Heidelberg},
keywords = {Component, Grid computing, Workflow, LEGO}
}
-
Yves Caniou,
Eddy Caron,
Ghislain Charrier,
Andréea Chis,
Frédéric Desprez,
and Eric Maisonnave.
Ocean-Atmosphere Modelization over the Grid.
In Wu-chi Feng and Yuanyuan Yang, editors,
The 37th International Conference on Parallel Processing (ICPP 2008),
Portland, Oregon. USA,
pages 206-213,
September 2008.
IEEE.
Keywords:
LEGO,
DIET.
@InProceedings{ InProceedingsCaniou.CCCCDM_08,
address = {Portland, Oregon. USA},
author = {Caniou, Yves and Caron, Eddy and Charrier, Ghislain and Chis, Andr{\'e}ea and Desprez, Fr{\'e}d{\'e}ric and Maisonnave, Eric},
booktitle = {The 37th International Conference on Parallel Processing (ICPP 2008)},
editor = {Feng, Wu-chi and Yang, Yuanyuan},
keywords = {LEGO, DIET},
month = sep,
organization = {IEEE},
pages = {206-213},
title = {Ocean-Atmosphere Modelization over the Grid},
year = 2008
}
-
Yves Caniou,
Eddy Caron,
Ghislain Charrier,
Frédéric Desprez,
Eric Maisonnave,
and Vincent Pichon.
Ocean-Atmosphere Application Scheduling within DIET.
In APDCT-08 Symposium. International Symposium on Advanced in Parallel and Distributed Computing Techniques,
Sydney. Australia.,
pages 675-680,
December 2008.
In conjunction with ISPA'2008,
IEEE Computer Society.
Note: Invited paper from the reviewed process of ISPA'08.
Keywords:
DIET,
LEGO.
@InProceedings{ InProceedingsCaniou.CCCDMP_08,
address = {Sydney. Australia.},
author = {Caniou, Yves and Caron, Eddy and Charrier, Ghislain and Desprez, Fr{\'e}d{\'e}ric and Maisonnave, Eric and Pichon, Vincent},
booktitle = {APDCT-08 Symposium. International Symposium on Advanced in Parallel and Distributed Computing Techniques},
keywords = {DIET, LEGO},
month = dec,
note = {Invited paper from the reviewed process of ISPA'08},
organization = {In conjunction with ISPA'2008},
pages = {675-680},
publisher = {IEEE Computer Society},
title = {Ocean-Atmosphere Application Scheduling within DIET},
year = 2008
}
-
Yves Caniou,
Jean-Sébastien Gay,
and Pierre Ramet.
Tunable parallel experiments in a GridRPC framework: application to linear solvers.
In VECPAR'08 International Meeting on High Performance Computing for Computational Science,
volume 5336 of LNCS,
pages 430--436,
2008.
Keywords:
DIET,
REDIMPS,
LEGO.
@InProceedings{ InProceedingsCaniou.CGR_08,
author = {Yves Caniou and Jean-S{\'e}bastien Gay and Pierre Ramet},
title = {Tunable parallel experiments in a {G}rid{RPC} framework: application to linear solvers},
booktitle = {VECPAR'08 International Meeting on High Performance Computing for Computational Science},
year = {2008},
series = {LNCS},
volume = {5336},
pages = {430--436},
keywords = {DIET, REDIMPS, LEGO}
}
-
Yves Caniou,
Noriyuki Kushida,
and Naoya Teshima.
Implementing interoperability between the AEGIS and DIET GridRPC middleware to build an international sparse linear algebra expert system.
In The Second IEEE International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2008),
pages 205--210,
2008.
Keywords:
DIET,
REDIMPS,
LEGO.
@InProceedings{ InProceedingsCaniou.CKT_08,
author = {Yves Caniou and Noriyuki Kushida and Naoya Teshima},
title = {Implementing interoperability between the {AEGIS} and {DIET} {G}rid{RPC} middleware to build an international sparse linear algebra expert system},
booktitle = {The Second IEEE International Conference on {A}dvanced {E}ngineering {C}omputing and {A}pplications in {S}ciences ({ADVCOMP} 2008)},
pages = {205--210},
year = {2008},
keywords = {DIET, REDIMPS, LEGO}
}
-
Eddy Caron,
Pushpinder Kaur Chouhan,
and Frédéric Desprez.
Automatic Middleware Deployment Planning on Heterogeneous Platfoms.
In The 17th Heterogeneous Computing Workshop (HCW'08),
Miami, Florida,
April 2008.
In conjunction with IPDPS 2008.
Keywords:
Deployment,
ASP,
Grid computing,
DIET,
LEGO.
@InProceedings{ InProceedingsCaron.CCD_08,
address = {Miami, Florida},
author = {Caron, Eddy and Chouhan, Pushpinder Kaur and Desprez, Fr{\'e}d{\'e}ric},
booktitle = {The 17th Heterogeneous Computing Workshop (HCW'08)},
keywords = {Deployment, ASP, Grid computing, DIET, LEGO},
month = apr,
organization = {In conjunction with IPDPS 2008},
title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
year = 2008
}
-
Eddy Caron,
Ajoy Datta,
Franck Petit,
and Cédric Tedeschi.
Self-stabilization in tree-structured P2P Service Discovery Systems.
In 27th International Symposium on Reliable Distributed Systems (SRDS 2008),
Napoli, Italy,
pages 207-216,
October 2008.
IEEE.
Keywords:
LEGO,
DLPT,
Self-stabilization.
@InProceedings{ InProceedingsCaron.CDPT_08,
address = {Napoli, Italy},
author = {Caron, Eddy and Datta, Ajoy and Petit, Franck and Tedeschi, C{\'e}dric},
booktitle = {27th International Symposium on Reliable Distributed Systems (SRDS 2008)},
keywords = {LEGO, DLPT, Self-stabilization},
month = oct,
organization = {IEEE},
pages = {207-216},
title = {Self-stabilization in tree-structured P2P Service Discovery Systems},
year = 2008
}
-
Eddy Caron,
Frédéric Desprez,
and Gaël Le Mahec.
Parallelization and Distribution Strategies of Large Bioinformatics Requests over the Grid.
In Springer Berlin / Heidelberg, editor,
Algorithms and Architectures for Parallel Processing,
volume Volume 5022/2008 of Lecture Notes in Computer Science,
pages 257-260,
2008.
@InProceedings{ InProceedingsCaron.CDL-M_08,
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Le Mahec, Ga{\"e}l},
booktitle = {Algorithms and Architectures for Parallel Processing},
editor = {Springer Berlin / Heidelberg},
pages = {257-260},
series = {Lecture Notes in Computer Science},
title = {Parallelization and Distribution Strategies of Large Bioinformatics Requests over the Grid},
volume = {Volume 5022/2008},
year = {2008}
}
-
Eddy Caron,
Frédéric Desprez,
and David Loureiro.
All-in-one Graphical Tool for the management of DIET a GridRPC Middleware.
In Norbert Meyer,
Domenico Talia,
and Ramin Yahyapour, editors,
Grid and Services Evolution,
Barcelona, Spain,
pages 169-187,
June 2008.
CoreGRID Workshop on Grid Middleware (in conjunction with OGF'23),
Springer.
Keywords:
DIET,
LEGO,
GWENDIA.
| Abstract: |
Grid middleware are the link between large scale (and distributed) platforms and applications. Managing such a software system and the grid environment itself can be a hard task when no dedicated (and integrated) tool exist. Some can be used through nice graphical interfaces, but they are usually dedicated to one or some limited tasks. They do not fulfill all the needs of a grid end-user who wants to deploy grid applications easily and rapidly. The aim of this paper is to present the case study of an all-in-one software system, designed for the management of a grid middleware and gathering user-friendly graphical interfaces answering to the various needs of end-users. Moreover the software system eases the use of the grid by avoiding the scripting layer under a nice GUI enabling the user a faster and more efficient use of the grid environment. By this means we demonstrate how the \ddb fulfills all the needs of a unified tool for grid management. This paper gives a comparison with existing and well-known tools dedicated to some specific tasks such as grid resources management, grid monitoring or middleware management. |
@InProceedings{ InProceedingsCaron.CDL_08,
abstract = { Grid middleware are the link between large scale (and distributed) platforms and applications. Managing such a software system and the grid environment itself can be a hard task when no dedicated (and integrated) tool exist. Some can be used through nice graphical interfaces, but they are usually dedicated to one or some limited tasks. They do not fulfill all the needs of a grid end-user who wants to deploy grid applications easily and rapidly. The aim of this paper is to present the case study of an all-in-one software system, designed for the management of a grid middleware and gathering user-friendly graphical interfaces answering to the various needs of end-users. Moreover the software system eases the use of the grid by avoiding the scripting layer under a nice GUI enabling the user a faster and more efficient use of the grid environment. By this means we demonstrate how the \ddb fulfills all the needs of a unified tool for grid management. This paper gives a comparison with existing and well-known tools dedicated to some specific tasks such as grid resources management, grid monitoring or middleware management.},
address = {Barcelona, Spain},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Loureiro, David},
booktitle = {Grid and Services Evolution},
editor = {Meyer, Norbert and Talia, Domenico and Yahyapour, Ramin},
keywords = {DIET,LEGO, GWENDIA},
month = jun,
organization = {CoreGRID Workshop on Grid Middleware (in conjunction with OGF'23)},
pages = {169-187},
publisher = {Springer},
title = {All-in-one Graphical Tool for the management of DIET a {GridRPC} Middleware},
year = 2008
}
-
Eddy Caron,
Frédéric Desprez,
and Cédric Tedeschi.
Efficiency of Tree-structured Peer-to-peer Service Discovery Systems.
In Fifth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P),
Miami, Florida,
April 2008.
In conjunction with IPDPS 2008.
| 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. |
@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
}
-
Ghislain Charrier.
From Scheduling Theory to Practice: a Case Study.
In The 5th International Conference on Soft Computing as Transdisciplinary Science and Technology,
Cergy-Pontoise. France,
October 28-31 2008.
ACM/IEEE.
@InProceedings{ InProceedingsCharrier.C_08,
address = {Cergy-Pontoise. France},
author = {Charrier, Ghislain},
booktitle = {The 5th International Conference on Soft Computing as Transdisciplinary Science and Technology},
month = {October 28-31},
page = {581--582},
organization = {ACM/IEEE},
title = {{From Scheduling Theory to Practice: a Case Study}},
year = {2008}
}
-
Philippe Combes,
Eddy Caron,
Frédéric Desprez,
Bastien Chopard,
and Julien Zory.
Relaxing Synchronization in a Parallel SystemC Kernel.
In ISPA 2008. International Symposium on Parallel and Distributed Processing with Applications,
Sydney. Australia,
pages 180-187,
December 2008.
IEEE Computer Society.
@InProceedings{ InProceedingsCombes.CCDCZ_08,
address = {Sydney. Australia},
author = {Combes, Philippe and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Chopard, Bastien and Zory, Julien},
booktitle = {ISPA 2008. International Symposium on Parallel and Distributed Processing with Applications},
month = dec,
pages = {180-187},
publisher = {IEEE Computer Society},
title = {Relaxing Synchronization in a Parallel SystemC Kernel},
year = 2008
}
-
Sylvain Dahan,
Alexandru Dobrila,
Jean-Marc Nicod,
and Laurent Philippe.
Performances Study of the Distributed Spanning Tree an Overlay Network for Server Lookup.
In ICIW - The Third International Conference on Internet and Web Applications and Services,
pages 330-335,
2008.
IEEE Computer Society.
@InProceedings{ InProceedingsDahan.DDNP_08*1,
author = {Dahan, Sylvain and Dobrila, Alexandru and Nicod, Jean-Marc and Philippe, Laurent},
title = {{Performances Study of the Distributed Spanning Tree an Overlay Network for Server Lookup}},
booktitle = {ICIW - The Third International Conference on Internet and Web Applications and Services},
year = {2008},
isbn = {978-0-7695-3163-2},
pages = {330-335},
publisher = {IEEE Computer Society}
}
-
Sylvain Dahan,
Alexandru Dobrila,
Jean-Marc Nicod,
and Laurent Philippe.
Étude des performances du Distributed Spanning Tree : un Overlay Network pour la Recherche de Services.
In Proceedings of CFSE'6, 6th Conférence Française en Systèmes d'Exploitation,
Fribourg, Switzerland,
2008.
@InProceedings{ InProceedingsDahan.DDNP_08,
author = {Dahan, Sylvain and Dobrila, Alexandru and Nicod, Jean-Marc and Philippe, Laurent},
title = {\'Etude des performances du Distributed Spanning Tree~: un Overlay Network pour la Recherche de Services},
booktitle = {Proceedings of CFSE'6, 6th Conf\'erence Fran\c caise en Syst\`emes d'Exploitation},
year = 2008,
address = {Fribourg, Switzerland}
}
-
Carole Delporte-Gallet,
Stéphane Devismes,
Hugues Fauconnier,
Franck Petit,
and Sam Toueg.
With Finite Memory Consensus is Easier Than Reliable Broadcast.
In 12th International Conference On Principles of Distributed Systems (OPODIS 2008),
volume 5401 of Lecture Notes in Computer Science, Springer,
Luxor, Egypt,
pages 41-57,
2008.
@InProceedings{ InProceedingsDelporte-Gallet.DDFPT_08,
author = {Carole Delporte-Gallet and St{\'e}phane Devismes and Hugues Fauconnier and Franck Petit and Sam Toueg},
title = {With Finite Memory Consensus is Easier Than Reliable Broadcast},
booktitle = {12th International Conference On Principles of Distributed Systems (OPODIS 2008)},
address = "Luxor, Egypt",
series = {Lecture Notes in Computer Science, Springer},
volume = {5401},
pages = {41-57},
year = {2008}
}
-
Benjamin Depardon.
Déploiement générique d'applications sur plates-formes hétérogènes distribuées.
In RenPar'18,
Fribourg, Switzerland,
February 2008.
Keywords:
Grilles de calcul,
Deployment,
planification,
intergiciel,
plate-forme hétérogène,
DIET,
LEGO.
| Abstract: |
Les actuelles plates-formes de calcul que sont les grilles confrontent les utilisateurs {\`a} une complexit{\'e} croissante d'utilisation de l'environnement. La n{\'e}cessit{\'e} d'avoir une m{\'e}thode simple, automatique et efficace de s{\'e}lection des ressources, ainsi que d'installation et d'ex{\'e}cution des applications devient primordiale. Les outils de d{\'e}ploiement actuels manquent de maturit{\'e} concernant leurs algorithmes de planification pour s{\'e}lectionner et allouer des ressources aux applications. C'est pourquoi il est n{\'e}cessaire d'en proposer de nouveaux qui soient efficaces et qui supportent aussi bien des applications s{\'e}quentielles, parall{\`e}les que hi{\'e}rarchiques. Cet article pr{\'e}sente diff{\'e}rentes heuristiques qui visent {\`a} r{\'e}partir la charge entre les diff{\'e}rents n{\oe}uds de calcul, {\`a} maximiser le nombre d'instances d{\'e}ploy{\'e}es sur la plate-forme, et {\`a} minimiser les co{\^u}ts de communication entre les applications, pour des applications s{\'e}quentielles et hi{\'e}rarchiques. Ces heuristiques ont {\'e}t{\'e} impl{\'e}ment{\'e}es dans le logiciel de d{\'e}ploiement ADAGE. Finalement, cet article pr{\'e}sente des simulations et des r{\'e}sultats exp{\'e}rimentaux. |
@InProceedings{ InProceedingsDepardon.D_08,
abstract = {Les actuelles plates-formes de calcul que sont les grilles confrontent les utilisateurs {\`a} une complexit{\'e} croissante d'utilisation de l'environnement. La n{\'e}cessit{\'e} d'avoir une m{\'e}thode simple, automatique et efficace de s{\'e}lection des ressources, ainsi que d'installation et d'ex{\'e}cution des applications devient primordiale. Les outils de d{\'e}ploiement actuels manquent de maturit{\'e} concernant leurs algorithmes de planification pour s{\'e}lectionner et allouer des ressources aux applications. C'est pourquoi il est n{\'e}cessaire d'en proposer de nouveaux qui soient efficaces et qui supportent aussi bien des applications s{\'e}quentielles, parall{\`e}les que hi{\'e}rarchiques. Cet article pr{\'e}sente diff{\'e}rentes heuristiques qui visent {\`a} r{\'e}partir la charge entre les diff{\'e}rents n{\oe}uds de calcul, {\`a} maximiser le nombre d'instances d{\'e}ploy{\'e}es sur la plate-forme, et {\`a} minimiser les co{\^u}ts de communication entre les applications, pour des applications s{\'e}quentielles et hi{\'e}rarchiques. Ces heuristiques ont {\'e}t{\'e} impl{\'e}ment{\'e}es dans le logiciel de d{\'e}ploiement ADAGE. Finalement, cet article pr{\'e}sente des simulations et des r{\'e}sultats exp{\'e}rimentaux.},
address = {Fribourg, Switzerland},
author = {Depardon, Benjamin},
booktitle = {RenPar'18},
keywords = {Grilles de calcul, Deployment, planification, intergiciel, plate-forme h{\'e}t{\'e}rog{\`e}ne, DIET, LEGO},
month = {feb},
title = {D{\'e}ploiement g{\'e}n{\'e}rique d'applications sur plates-formes h{\'e}t{\'e}rog{\`e}nes distribu{\'e}es},
year = {2008}
}
-
Frédéric Desprez,
Eddy Caron,
and Gaël Le Mahec.
DAGDA: Data Arrangement for the Grid and Distributed Applications.
In AHEMA 2008. International Workshop on Advances in High-Performance E-Science Middleware and Applications. In conjunction with eScience 2008,
Indianapolis, Indiana, USA,
pages 680-687,
December 2008.
Keywords:
DIET,
DAGDA,
LEGO.
@InProceedings{ InProceedingsDesprez.DCL-M_08,
address = {Indianapolis, Indiana, USA},
author = {Desprez, Fr{\'e}d{\'e}ric and Caron, Eddy and Le Mahec, Ga{\"e}l},
booktitle = {AHEMA 2008. International Workshop on Advances in High-Performance E-Science Middleware and Applications. In conjunction with eScience 2008},
keywords = {DIET, DAGDA, LEGO},
month = dec,
pages = {680-687},
title = {DAGDA: Data Arrangement for the Grid and Distributed Applications},
year = 2008
}
-
Sékou Diakité,
Jean-Marc Nicod,
and Laurent Philippe.
Adaptation d'un algorithme optimal d'ordonnancement en régime permanent pour des lots bornés.
In Proceedings of RenPar'18, 18èmes Rencontres francophones du Parallélisme,
Fribourg, Switzerland,
2008.
@InProceedings{ InProceedingsDiakite.DNP_08*1,
author = {Diakit\'e, S\'ekou and Nicod, Jean-Marc and Philippe, Laurent},
title = {Adaptation d'un algorithme optimal d'ordonnancement en r\'egime permanent pour des lots born\'es},
booktitle = {Proceedings of RenPar'18, 18\`emes Rencontres francophones du Parall\'elisme},
address = {Fribourg, Switzerland},
year = 2008
}
-
Sékou Diakité,
Jean-Marc Nicod,
and Laurent Philippe.
Comparison of Batch Scheduling for Identical Multi-Tasks Jobs on Heterogeneous Platforms.
In Proceedings of PDP 2008, 16th Euromicro International Conference on Parallel, Distributed and network-based Processing,
Toulouse, France,
pages 374--378,
2008.
@InProceedings{ InProceedingsDiakite.DNP_08,
author = {Diakit\'e, S\'ekou and Nicod, Jean-Marc and Philippe, Laurent},
title = {Comparison of Batch Scheduling for Identical Multi-Tasks Jobs on Heterogeneous Platforms},
booktitle = {Proceedings of PDP 2008, 16th Euromicro International Conference on Parallel, Distributed and network-based Processing},
year = 2008,
pages = {374--378},
address = {Toulouse, France}
}
-
Sékou Diakité,
Jean-Marc Nicod,
and Laurent Philippe.
Processing Identical Workflows on SOA Grids: Comparison of Three Approaches.
In Procs of the The IEEE International Conference on Distributed Frameworks & Applications -- DFmA'2008,
Penang, Malaysia,
pages 27--34,
October 2008.
Keywords:
Scheduling.
@InProceedings{ InProceedingsDiakite.DNP_08*2,
author = {Diakit\'e, S\'ekou and Nicod, Jean-Marc and Philippe, Laurent},
title = {{Processing Identical Workflows on SOA Grids: Comparison of Three Approaches}},
booktitle = {Procs of the The IEEE International Conference on Distributed Frameworks \& Applications -- DFmA'2008},
pages = {27--34},
address = {Penang, Malaysia},
month = oct,
year = 2008,
keywords = {Scheduling}
}
-
Jack Dongarra,
Jean-François Pineau,
Yves Robert,
and Frédéric Vivien.
Matrix Product on Heterogeneous Master-Worker Platforms.
In 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
Salt Lake City, Utah,
pages 53--62,
February 2008.
@InProceedings{ InProceedingsDongarra.DPRV_08,
author = "Jack Dongarra and Jean-Fran\c{c}ois Pineau and Yves Robert and Fr\'ed\'eric Vivien",
title = "Matrix Product on Heterogeneous Master-Worker Platforms",
booktitle = "13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming",
address = {Salt Lake City, Utah},
month = feb,
pages = {53--62},
year = 2008
}
-
Matthieu Gallet,
Loris Marchal,
and Frédéric Vivien.
Allocating Series of Workflows on Computing Grids.
In Proceedings of the 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS'08),
pages 48-55,
2008.
IEEE Computer Society Press.
@InProceedings{ InProceedingsGallet.GMV_08,
author = {Matthieu Gallet and Loris Marchal and Fr\'ed\'eric Vivien},
title = {Allocating Series of Workflows on Computing Grids},
booktitle = {Proceedings of the 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS'08)},
year = 2008,
publisher = {IEEE Computer Society Press},
pages = {48-55}
}
-
Daniel Kahn,
Clément Rezvoy,
and Frédéric Vivien.
Parallel large scale inference of protein domain families.
In ICPADS'2008, the 14th IEEE International Conference on Parallel and Distributed Systems,
pages 72-79,
2008.
IEEE Computer Society Press.
@InProceedings{ InProceedingsKahn.KRV_08,
author = {Daniel Kahn and Cl\'ement Rezvoy and Fr\'ed\'eric Vivien},
title = {Parallel large scale inference of protein domain families},
booktitle = {{ICPADS'2008}, the 14th IEEE International Conference on Parallel and Distributed Systems},
publisher = {IEEE Computer Society Press},
year = 2008,
pages = {72-79}
}
-
Noriyuki Kushida,
Yoshio Suzuki,
Naoya Teshima,
Norihiro Nakajima,
Yves Caniou,
Michel Daydé,
and Pierre Ramet.
Toward an International Sparse Linear Algebra Expert System by Interconnecting the ITBL Computational Grid with the GridTLSE Platform.
In VECPAR'08 International Meeting on High Performance Computing for Computational Science,
volume 5336 of LNCS,
pages 424--429,
2008.
Keywords:
DIET,
REDIMPS,
LEGO.
@InProceedings{ InProceedingsKushida.KSTNCDR_08,
author = {Noriyuki Kushida and Yoshio Suzuki and Naoya Teshima and Norihiro Nakajima and Yves Caniou and Michel Dayd{\'e} and Pierre Ramet},
title = {Toward an International Sparse Linear Algebra Expert System by Interconnecting the {ITBL} Computational Grid with the {G}rid{TLSE} Platform},
booktitle = {VECPAR'08 International Meeting on High Performance Computing for Computational Science},
series = {LNCS},
volume = {5336},
year = {2008},
pages = {424--429},
keywords = {DIET, REDIMPS, LEGO}
}
-
Yannis Mazzer and Bernard Tourancheau.
MPI in Wireless Sensor Networks.
In PVM/MPI Recent Advances in Parallel Virtual Machine and Message Passing Interface,
volume 5205 of Lecture Notes in Computer Science,
pages 334-339,
2008.
Springer.
@InProceedings{ InProceedingsMazzer.MT_08,
author = {Mazzer, Yannis and Tourancheau, Bernard},
booktitle = {PVM/MPI Recent Advances in Parallel Virtual Machine and Message Passing Interface},
pages = {334-339},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {{MPI} in Wireless Sensor Networks},
volume = {5205},
year = {2008}
}
-
Jean-Marc Nicod,
Laurent Philippe,
and Hala Sabbah.
Optimizing the Cost of an Heterogeneous Distributed Platform.
In Procs of the The IEEE International Conference on Distributed Frameworks & Applications -- DFmA'2008,
Penang, Malaysia,
pages 60--67,
October 2008.
@InProceedings{ InProceedingsNicod.NPS_08,
author = {Nicod, Jean-Marc and Philippe, Laurent and Sabbah, Hala},
title = {{Optimizing the Cost of an Heterogeneous Distributed Platform}},
booktitle = {Procs of the The IEEE International Conference on Distributed Frameworks \& Applications -- DFmA'2008},
pages = {60--67},
address = {Penang, Malaysia},
month = oct,
year = 2008
}
-
Cédric Tedeschi.
Arbre de préfixes auto-stable pour les systèmes pair-à-pair.
In Fribourg'2008 - Conférences conjointes RenPar'18 / SympA'2008 / CFSE'6,
Fribourg, Suisse,
February 2008.
@InProceedings{ InProceedingsTedeschi.T_08,
address = {Fribourg, Suisse},
author = {Tedeschi, C{\'e}dric},
booktitle = {Fribourg'2008 - Conf{\'e}rences conjointes RenPar'18 / SympA'2008 / CFSE'6},
month = feb,
title = {{Arbre de pr{\'e}fixes auto-stable pour les syst{\`e}mes pair-{\`a}-pair}},
year = {2008}
}
-
Bernard Tourancheau,
Gérard Krauss,
and Richard Blanchard.
Parametric Sensitivity Study and Optimization of the SDHW and PV Subsystems in an Energy Positive House.
In IBPSA-France,
2008.
@InProceedings{ InProceedingsTourancheau.TKB_08,
author = {Tourancheau, Bernard and Krauss, G\'erard and Blanchard, Richard},
booktitle = {IBPSA-France},
title = {Parametric Sensitivity Study and Optimization of the {SDHW} and {PV} Subsystems in an Energy Positive House},
year = {2008}
}
-
Bernard Tourancheau,
Yannis Mazzer,
Gérard Krauss,
Valentin Marvan,
and Frederic Kuznick.
Calibration of sensors embedded on a micro-controler based wireless network.
In IBPSA-France,
2008.
@InProceedings{ InProceedingsTourancheau.TMKMK_08,
author = {Bernard Tourancheau and Yannis Mazzer and G{\'e}rard Krauss and Valentin Marvan and Frederic Kuznick},
booktitle = {IBPSA-France},
title = {Calibration of sensors embedded on a micro-controler based wireless network},
year = {2008}
}
-
Bora Uçar.
Heuristics for a matrix symmetrization problem.
In R. Wyrzykowski,
J. Dongarra,
K. Karczewski,
and J. Wasniewski, editors,
Proceedings of Parallel Processing and Applied Mathematics (PPAM'07),
volume 4967 of Lecture Notes in Computer Science,
pages 718--727,
2008.
@InProceedings{ InProceedingsUcar.U_08,
author = {Bora U\c{c}ar},
booktitle = {Proceedings of Parallel Processing and Applied Mathematics (PPAM'07)},
editor = {R. Wyrzykowski and J. Dongarra and K. Karczewski and J. Wasniewski},
pages = {718--727},
series = {Lecture Notes in Computer Science},
title = {Heuristics for a matrix symmetrization problem},
volume = {4967},
year = {2008}
}
-
Eddy Caron,
Pushpinder Kaur Chouhan,
and Frédéric Desprez.
Automatic Middleware Deployment Planning on Heterogeneous Platfoms.
Technical report 6566,
Institut National de Recherche en Informatique et en Automatique (INRIA),
June 2008.
Note: Also available as LIP Research Report 2008-23.
Keywords:
Deployment,
ASP,
Grid computing,
DIET,
LEGO.
| 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. |
@TechReport{ TechReportRR-Institut-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 = jun,
note = {Also available as LIP Research Report 2008-23},
number = {6566},
title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
year = 2008
}
-
Eddy Caron,
Pushpinder Kaur Chouhan,
and Frédéric Desprez.
Automatic Middleware Deployment Planning on Heterogeneous Platfoms.
Technical report RR-2008-23,
Laboratoire de l'Informatique du Parallélisme (LIP),
June 2008.
Note: Also available as INRIA Research Report 6566.
Keywords:
Deployment,
ASP,
Grid computing,
DIET,
LEGO.
| 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. |
@TechReport{ TechReportRR-Laboratoire-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 = jun,
note = {Also available as INRIA Research Report 6566},
number = {RR-2008-23},
title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
year = 2008
}
-
Eddy Caron,
Ajoy Datta,
Benjamin Depardon,
and Lawrence Larmore.
A Self-Stabilizing K-clustering algorithm using an arbitrary metric.
Research report RR2008-31,
Laboratoire de l'Informatique du Parallélisme (LIP),
October 2008.
Keywords:
k-clustering,
self-stabilization,
weighted graph,
LEGO.
@TechReport{ TechReportRR-Laboratoire-RR2008-31,
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 = {October},
number = {RR2008-31},
title = {A Self-Stabilizing K-clustering algorithm using an arbitrary metric},
type = {Research report},
year = {2008}
}
-
Eddy Caron,
Frédéric Desprez,
and David Loureiro.
All-in-one Graphical Tool for the management of DIET a GridRPC Middleware.
Technical report RR2008-24,
Laboratoire de l'Informatique du Parallélisme (LIP),
June 2008.
Keywords:
DIET,
LEGO,
GWENDIA.
| Abstract: |
Grid middleware are the link between large scale (and distributed) platforms and applications. Managing such a software system and the grid environment itself can be a hard task when no dedicated (and integrated) tool exist. Some can be used through nice graphical interfaces, but they are usually dedicated to one or some limited tasks. They do not fulfill all the needs of a grid end-user who wants to deploy grid applications easily and rapidly. The aim of this paper is to present the case study of an all-in-one software system, designed for the management of a grid middleware and gathering user-friendly graphical interfaces answering to the various needs of end-users. Moreover the software system eases the use of the grid by avoiding the scripting layer under a nice GUI enabling the user a faster and more efficient use of the grid environment. By this means we demonstrate how the \ddb fulfills all the needs of a unified tool for grid management. This paper gives a comparison with existing and well-known tools dedicated to some specific tasks such as grid resources management, grid monitoring or middleware management. |
@TechReport{ TechReportRR-Laboratoire-RR2008-24,
abstract = { Grid middleware are the link between large scale (and distributed) platforms and applications. Managing such a software system and the grid environment itself can be a hard task when no dedicated (and integrated) tool exist. Some can be used through nice graphical interfaces, but they are usually dedicated to one or some limited tasks. They do not fulfill all the needs of a grid end-user who wants to deploy grid applications easily and rapidly. The aim of this paper is to present the case study of an all-in-one software system, designed for the management of a grid middleware and gathering user-friendly graphical interfaces answering to the various needs of end-users. Moreover the software system eases the use of the grid by avoiding the scripting layer under a nice GUI enabling the user a faster and more efficient use of the grid environment. By this means we demonstrate how the \ddb fulfills all the needs of a unified tool for grid management. This paper gives a comparison with existing and well-known tools dedicated to some specific tasks such as grid resources management, grid monitoring or middleware management.},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Loureiro, David},
institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
keywords = {DIET, LEGO, GWENDIA},
month = jun,
number = {RR2008-24},
title = {All-in-one Graphical Tool for the management of DIET a {GridRPC} Middleware},
year = 2008
}
-
Eddy Caron,
Frédéric Desprez,
and Cédric Tedeschi.
Efficiency of Tree-structured Peer-to-peer Service Discovery Systems.
Technical report RR-6557,
Institut National de Recherche en Informatique et en Automatique (INRIA),
June 2008.
Note: Also available as LIP Research Report 2008-18.
Keywords:
Service discovery,
computational grids,
peer-to-peer,
prefix trees,
mapping,
load balancing,
LEGO.
| 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. |
@TechReport{ TechReportRR-Institut-RR-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},
title = {Efficiency of Tree-structured Peer-to-peer Service Discovery Systems},
url = {http://hal.inria.fr/inria-00287800/fr/},
year = 2008
}
-
Eddy Caron,
Frédéric Desprez,
and Cédric Tedeschi.
Efficiency of Tree-Structured Peer-to-peer Service Discovery Systems.
Technical report RR2008-18,
Laboratoire de l'Informatique du Parallélisme (LIP),
June 2008.
Note: Also available as INRIA Research Report 6557.
Keywords:
Service discovery,
computational grids,
peer-to-peer,
prefix trees,
mapping,
load balancing,
LEGO.
| 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. |
@TechReport{ TechReportRR-Laboratoire-RR2008-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 = jun,
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
}
-
Benjamin Depardon.
Déploiement générique d'applications sur plates-formes hétérogènes distribuées.
Research Report 6434,
INRIA,
January 2008.
Note: Also available as LIP Research Report 2008-06.
Keywords:
Deployment,
DIET.
@TechReport{ TechReportRR-INRIA-6434,
author = {Depardon, Benjamin},
keywords = {Deployment, DIET},
month = {January},
note = {Also available as LIP Research Report 2008-06},
number = {6434},
title = {D{\'e}ploiement g{\'e}n{\'e}rique d'applications sur plates-formes h{\'e}t{\'e}rog{\`e}nes distribu{\'e}es},
type = {Research Report},
institution = {INRIA},
url = {https://hal.inria.fr/inria-00229576},
year = {2008}
}
-
Benjamin Depardon.
Déploiement générique d'applications sur plates-formes hétérogènes distribuées.
Research Report 6434,
Laboratoire de l'Informatique du Parallélisme (LIP),
January 2008.
Note: Also available as INRIA Research Report 6434.
Keywords:
Grilles de calcul,
Deployment,
planification,
intergiciel,
plate-forme hétérogène,
DIET,
LEGO.
@TechReport{ TechReportRR-Laboratoire-6434,
author = {Depardon, Benjamin},
institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
keywords = {Grilles de calcul, Deployment, planification, intergiciel, plate-forme h{\'e}t{\'e}rog{\`e}ne, DIET, LEGO},
month = {January},
note = {Also available as INRIA Research Report 6434},
number = {6434},
pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2008/RR2008-06.pdf},
title = {D{\'e}ploiement g{\'e}n{\'e}rique d'applications sur plates-formes h{\'e}t{\'e}rog{\`e}nes distribu{\'e}es},
type = {Research Report},
url = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2008/RR2008-06.pdf},
year = {2008}
}
-
Matthieu Gallet,
Loris Marchal,
and Frédéric Vivien.
Allocating Series of Workflows on Computing Grids.
Research report RR-6603,
LIP, École Normale Supérieure de Lyon,
2008.
@TechReport{ TechReportRR-LIP-RR-6603,
author = {Matthieu Gallet and Loris Marchal and Fr{\'e}d{\'e}ric Vivien},
title = {Allocating Series of Workflows on Computing Grids},
institution = {LIP, \'Ecole Normale Sup\'erieure de Lyon},
year = {2008},
number = {RR-6603},
type = {Research report}
}
-
Arnaud Legrand,
Alan Su,
and Frédéric Vivien.
Minimizing the stretch when scheduling flows of divisible requests.
Research Report RR2008-08,
LIP, École Normale Supérieure de Lyon,
February 2008.
Note: This is a revised version of the LIP research report RR2006-19. Also available as INRIA research report 6002 rlhttp://hal.inria.fr/inria-00108524.
@TechReport{ TechReportRR-LIP-RR2008-08,
author = {Arnaud Legrand and Alan Su and Fr\'ed\'eric Vivien},
title = {Minimizing the stretch when scheduling flows of divisible requests},
institution = {LIP, \'Ecole Normale Sup\'erieure de Lyon},
year = 2008,
number = {RR2008-08},
month = feb,
type = {Research Report},
note = {This is a revised version of the LIP research report RR2006-19. Also available as INRIA research report 6002 \url{http://hal.inria.fr/inria-00108524}.}
}
-
Yannis Mazzer and Bernard Tourancheau.
Réseaux de micro-contrôleurs à faible consommation d'énergie embarquant des capteurs.
Technical report 00256210,
INRIA,
janvier 2008.
@TechReport{ TechReportRR-INRIA-00256210,
author = {Yannis Mazzer and Bernard Tourancheau},
institution = {INRIA},
month = {janvier},
number = {00256210},
title = {R{\'e}seaux de micro-contr{\^o}leurs {\`a} faible consommation d'{\'e}nergie embarquant des capteurs},
year = {2008}
}