Keywords: LEGO. [bibtex-key = bookhagimont.hsbd_08] [bibtex-entry]
Keywords: Component, Distributed applications, Abstraction, Programming paradigm, LEGO. [bibtex-key = phdthesisphd-bouziane_08] [bibtex-entry]
Note: To appear.
Keywords: DIET, GridRPC, LEGO. [bibtex-key = inb-caniou.ccdnst_08] [bibtex-entry]
Keywords: Scheduling, DIET, LEGO. [bibtex-key = articleamar.abccddgl-ml_ccpe08] [bibtex-entry]
Keywords: Scheduling, DIET, LEGO. [bibtex-key = articlecaron.ccds_fgcs08] [bibtex-entry]
Keywords: DIET, LEGO. [bibtex-key = articlegay.gc_r-tsi08] [bibtex-entry]
Keywords: Gfarm, CONSISTENCY, DATA SHARING, JUXMEM, JXTA, PEER-TO-PEER, LEGO. [bibtex-key = inproceedingsantoniu.acgt_08] [bibtex-entry]
Keywords: DIET, LEGO. [bibtex-key = inproceedingsastsatryan.assdhpc_08] [bibtex-entry]
Keywords: Component, Grid computing, Workflow, LEGO. [bibtex-key = inproceedingsbouziane.bpp_08] [bibtex-entry]
Keywords: LEGO. [bibtex-key = inproceedingsbroto.bhacb_08] [bibtex-entry]
Keywords: LEGO. [bibtex-key = inproceedingsbroto.bhsdt_08] [bibtex-entry]
Keywords: LEGO. [bibtex-key = inproceedingsbroto.bsbhd_08] [bibtex-entry]
Keywords: LEGO, DIET. [bibtex-key = inproceedingscaniou.ccccdm_08] [bibtex-entry]
Note: Invited paper from the reviewed process of ISPA'08.
Keywords: DIET, LEGO. [bibtex-key = inproceedingscaniou.cccdmp_08] [bibtex-entry]
Keywords: DIET, REDIMPS, LEGO. [bibtex-key = inproceedingscaniou.cgr_08] [bibtex-entry]
Keywords: DIET, REDIMPS, LEGO. [bibtex-key = inproceedingscaniou.ckt_08] [bibtex-entry]
Keywords: Deployment, ASP, Grid computing, DIET, LEGO. [bibtex-key = inproceedingscaron.ccd_08] [bibtex-entry]
Keywords: LEGO, DLPT, Self-stabilization. [bibtex-key = inproceedingscaron.cdpt_08] [bibtex-entry]
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. |
Keywords: LEGO, DEPLOYMENT.
| Abstract: | Nowadays large-scale, grid-aware applications are intended to run for days or even weeks over hundreds or thousands of nodes. This requires new, and often painful operations for the user in charge of deployment and monitoring. We claim that the applications should themselves manage their run in an autonomic way, by requesting new resources on-demand. In this paper, we introduce Co{RDAG}e, a third-party tool, standing between applications and lower-level grid management tools. It provides generic and application-specific facilities to dynamically expand and retract the deployment of a grid-aware application according to its actual needs. A prototype has been implemented and a preliminary testing has been conducted on the Grid'5000 testbed. |
Note: To appear.
Keywords: DIET, DAGDA, LEGO. [bibtex-key = inproceedingsdesprez.dcl-m_08] [bibtex-entry]
Keywords: DIET, REDIMPS, LEGO. [bibtex-key = inproceedingskushida.kstncdr_08] [bibtex-entry]
Keywords: LEGO. [bibtex-key = inproceedingstoure.tbsbdh_08] [bibtex-entry]
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. |
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. |
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. |
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. |
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. |