-
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.
Note: Hal-00689914.
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,
note = {hal-00689914},
pages = {106-113},
title = {A Grid-Aware Web Interface with Advanced Service Trading for Linear Algebra Calculations},
url = {https://hal.inria.fr/hal-00689914},
year = 2008
}
-
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.
Note: Hal-01428737.
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,
note = {hal-01428737},
organization = {IEEE},
pages = {206-213},
title = {Ocean-Atmosphere Modelization over the Grid},
url = {https://hal.inria.fr/hal-01428737},
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. hal-01428060.
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. hal-01428060},
organization = {In conjunction with ISPA'2008},
pages = {675-680},
publisher = {IEEE Computer Society},
title = {Ocean-Atmosphere Application Scheduling within DIET},
url = {https://hal.inria.fr/hal-01428060},
year = 2008
}
-
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.
Note: Hal-01428310.
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,
note = {hal-01428310},
organization = {In conjunction with IPDPS 2008},
title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
url = {https://hal.inria.fr/hal-01428310},
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.
Note: Hal-01428529.
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,
note = {hal-01428529},
organization = {IEEE},
pages = {207-216},
title = {Self-stabilization in tree-structured P2P Service Discovery Systems},
url = {https://hal.inria.fr/hal-01428529},
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. 8th International Conference, ICA3PP.,
volume Volume 5022/2008 of Lecture Notes in Computer Science,
Cyprus,,
pages 257-260,
June 9-11 2008.
Note: Hal-01428318.
@InProceedings{ InProceedingsCaron.CDL-M_08,
address = {Cyprus,},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Le Mahec, Ga{\"e}l},
booktitle = {Algorithms and Architectures for Parallel Processing. 8th International Conference, ICA3PP.},
editor = {Springer Berlin / Heidelberg},
month = {June 9-11},
note = {hal-01428318},
pages = {257-260},
series = {Lecture Notes in Computer Science},
title = {Parallelization and Distribution Strategies of Large Bioinformatics Requests over the Grid},
url = {https://hal.inria.fr/hal-01428318},
volume = {Volume 5022/2008},
year = {2008}
}
-
Eddy Caron,
Frédéric Desprez,
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.
IEEE.
Note: Hal-01428409.
Keywords:
DIET,
DAGDA,
LEGO.
@InProceedings{ InProceedingsCaron.CDL-M_08*1,
address = {Indianapolis, Indiana, USA},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric 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,
note = {hal-01428409},
pages = {680-687},
publisher = {IEEE},
title = {{DAGDA}: Data Arrangement for the Grid and Distributed Applications},
url = {https://hal.inria.fr/hal-01428409},
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.
Note: Hal-01428518.
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,
note = {hal-01428518},
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},
url = {https://hal.inria.fr/hal-01428518},
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.
Note: Hal-01428782.
| 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,
note = {hal-01428782},
organization = {In conjunction with IPDPS 2008},
title = {Efficiency of Tree-structured Peer-to-peer Service Discovery Systems},
url = {https://hal.inria.fr/hal-01428782},
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.
Note: Hal-01428323.
@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,
note = {hal-01428323},
pages = {180-187},
publisher = {IEEE Computer Society},
title = {{Relaxing Synchronization in a Parallel SystemC Kernel}},
url = {https://hal.inria.fr/hal-01428323},
year = 2008
}
-
Yves Caniou,
Eddy Caron,
Ghislain Charrier,
Andréea Chis,
Frédéric Desprez,
and Eric Maisonnave.
Ocean-Atmosphere Modelization over the Grid.
Technical report RR-6695,
Institut National de Recherche en Informatique et en Automatique (INRIA),
October 2008.
Note: Hal number inria-00332571.
| Abstract: |
In this report, we tackle the problem of scheduling an Ocean-Atmosphere ap- plication used for climate prediction on the grid. An experiment is composed of several 1D-meshes of identical DAGs composed of parallel tasks. To obtain a good completion time, we divide groups of processors into sets each working on parallel tasks. The group sizes are chosen by computing the best makespan for several grouping possibilities. We improved this heuristic method by different means. The improvement yielding to the best makespan is the representation of the problem as an instance of the Knapsack problem. As this heuristic is firstly designed for homogeneous platforms, we present its adaptation to heterogeneous platforms. Simulations show improvements of the makespan up to 12 |
@TechReport{ TechReportRR-Institut-RR-6695,
abstract = {In this report, we tackle the problem of scheduling an Ocean-Atmosphere ap- plication used for climate prediction on the grid. An experiment is composed of several 1D-meshes of identical DAGs composed of parallel tasks. To obtain a good completion time, we divide groups of processors into sets each working on parallel tasks. The group sizes are chosen by computing the best makespan for several grouping possibilities. We improved this heuristic method by different means. The improvement yielding to the best makespan is the representation of the problem as an instance of the Knapsack problem. As this heuristic is firstly designed for homogeneous platforms, we present its adaptation to heterogeneous platforms. Simulations show improvements of the makespan up to 12},
author = {Caniou, Yves and Caron, Eddy and Charrier, Ghislain and Chis, Andr{\'e}ea and Desprez, Fr{\'e}d{\'e}ric and Maisonnave, Eric},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
month = oct,
note = {hal number inria-00332571},
number = {RR-6695},
title = {Ocean-Atmosphere Modelization over the Grid},
url = {https://hal.inria.fr/inria-00332571},
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. hal number inria-00291515.
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. hal number inria-00291515},
number = {6566},
title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
url = {https://hal.inria.fr/inria-00291515},
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. hal-01428306.
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. hal-01428306},
number = {RR-2008-23},
title = {Automatic Middleware Deployment Planning on Heterogeneous Platfoms},
url = {https://hal.inria.fr/hal-01428306},
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.
Note: Hal-01428795.
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},
note = {hal-01428795},
number = {RR2008-31},
title = {A Self-Stabilizing K-clustering algorithm using an arbitrary metric},
type = {Research report},
url = {https://hal.inria.fr/hal-01428795},
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,
Institut National de Recherche en Informatique et en Automatique (INRIA),
June 2008.
Note: Also available as LIP Research Report 2001-24. Hal number inria-00292575.
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{ Tec-Caron.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.},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Loureiro, David},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
keywords = {DIET, LEGO, GWENDIA},
month = jun,
note = {Also available as LIP Research Report 2001-24. Hal number inria-00292575},
title = {All-in-one Graphical Tool for the management of DIET a {GridRPC} Middleware},
url = {https://hal.inria.fr/inria-00292575},
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.
Note: Hal-01428434.
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,
note = {hal-01428434},
number = {RR2008-24},
title = {All-in-one Graphical Tool for the management of DIET a {GridRPC} Middleware},
url = {https://hal.inria.fr/hal-01428434},
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. hal number inria-00287800.
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. hal number inria-00287800},
number = {RR-6557},
title = {Efficiency of Tree-structured Peer-to-peer Service Discovery Systems},
url = {http://hal.inria.fr/inria-00287800/},
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. hal-01428771.
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. hal-01428771},
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},
url = {https://hal.inria.fr/hal-01428771},
year = 2008
}