A Scalable Approach to Network Enabled Servers

Caron, Eddy; Desprez, Frédéric; Lombard, Frédéric; Nicod, Jean-Marc; Philippe, Laurent; Quinson, Martin; Suter, Frédéric

doi:10.1007/3-540-45706-2_128

Cited by 37 publications

(38 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have developed a simple application representation for DIET [8], a grid computing environment based on the Grid-RPC approach [29]. This representation, which is a hierarchy of processes, is represented as a hierarchy of system entities in GADE.…”

Section: Implementation Of Translatorsmentioning

confidence: 99%

Generic application description model: toward automatic deployment of applications on computational grids

Lacour

Pérez

Priol

2005

The 6th IEEE/ACM International Workshop on Grid Computing, 2005.

View full text Add to dashboard Cite

Abstract:Computational grids promise to deliver a huge computer power as transparently as the electric power grid supplies electricity. Thus, applications need to be automatically deployed on computational grids. However, various types of applications may be run on a grid (component-based, MPI, etc.), so it may not be wise to design an automatic deployment tool for each specific programming model. This paper promotes a generic application description model which can express several specific application descriptions. Translating a specific application description into our generic description is a simple task. Then, developing new planning algorithms and re-using them for different application types will be much easier. Moreover, our generic description model allows to deploy applications based on a programming model combining several models, as parallel components encompass component-based and parallel programming models for instance. Our generic description model is implemented in an automatic deployment tool which can deploy CCM and MPICH-G2 applications. Key-words:

show abstract

Section: Implementation Of Translatorsmentioning

confidence: 99%

Generic application description model: toward automatic deployment of applications on computational grids

Lacour

Pérez

Priol

2005

The 6th IEEE/ACM International Workshop on Grid Computing, 2005.

View full text Add to dashboard Cite

show abstract

“…JNGI [28], DIET [10] or XtremWeb [15]) o er such a programming model. A major advantage of this paradigm lies in the ability for the client to easily cope with servers failures.…”

Section: Introductionmentioning

confidence: 99%

P2P-MPI: A Peer-to-Peer Framework for Robust Execution of Message Passing Parallel Programs on Grids

Genaud

Rattanapoka

2006

J Grid Computing

View full text Add to dashboard Cite

show abstract

“…GridRPC [25] provides a standard API for this approach in grid environments. Several network enabled server (NES) environments have been developed for the grid [5,7,8,21]. In these systems, clients submit computation requests to a scheduling agent whose goal is to find a server available on the grid.…”

Section: Introductionmentioning

confidence: 99%

Experiences with Hierarchical Request Flow Management for Network-Enabled Server Environments

Dail

Desprez

2006

The International Journal of High Performance Computing Applica

Self Cite

View full text Add to dashboard Cite

DIET (Distributed Interactive Engineering Toolbox) is a toolbox for the construction of Network Enabled Server systems. Client requests for computational services are automatically matched with available resources by a distributed hierarchy of scheduling agents. Traditionally NES systems have used a centralized agent for performance prediction and resource information management; in DIET, these services are distributed by providing them at the DIET server level. DIET has traditionally offered an online scheduling model whereby all requests are scheduled immediately or refused. This approach can overload interactive servers in high-load conditions and does not allow adaptation of the schedule to task or data dependencies. In this article we consider an alternative model based on active management of the flow of requests throughout the system. We have added support for (1) limiting the number of concurrent requests on interactive servers, (2) server and agent-level queues, and (3) window-based scheduling algorithms whereby the request release rate to servers can be controlled and some re-arrangement of request to host mappings is possible. We present experiments demonstrating that these approaches can improve performance and that the overheads introduced are not significantly different from those of the standard DIET approach. Key

show abstract

A Scalable Approach to Network Enabled Servers

Cited by 37 publications

References 9 publications

Generic application description model: toward automatic deployment of applications on computational grids

Generic application description model: toward automatic deployment of applications on computational grids

P2P-MPI: A Peer-to-Peer Framework for Robust Execution of Message Passing Parallel Programs on Grids

Experiences with Hierarchical Request Flow Management for Network-Enabled Server Environments

Contact Info

Product

Resources

About