GLARE: A Grid Activity Registration, Deployment and Provisioning Framework

Siddiqui, Mumtaz; Villazón, Alex; Hofer, Jürgen; Fahringer, Thomas

doi:10.1109/sc.2005.30

Cited by 33 publications

(19 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some other studies (e.g. GLARE [6]) propose approaches to install and deploy scientific applications with less involvement of administrators. Projects like CGSP2 [2] support traditional legacy software tools to be packaged and wrapped as Web Services so that they can be manually transferred to and invoked on other nodes without reinstallation.…”

Section: Dynamic Deploymentmentioning

confidence: 99%

“…[3][4][5][6]10,11], addressing the problem of dynamic application deployment in grid, do not focus on application replacement strategies. DAG-Condor [8], however, exploits a Least Recently/Frequently Used (LRFU)-based replacement strategy, which does not address the multi-cache problem: a single catch has to be selected before a cache object is placed or evicted.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Improving grid performance by dynamically deploying applications

Chen

Liu

et al. 2010

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYGrid applications are normally deployed on computing nodes beforehand, which may cause the undesirable situation that some of these nodes (with hot applications deployed) are always busy whereas the others are consistently idle. Therefore, the overall performance (e.g. throughput and load balancing) of such a Grid system would be seriously degraded. In this paper, we present the idea of Hierarchical and Dynamic Deployment of Application (HDDA) in Grid to improve the system performance. With HDDA, an application can be dynamically deployed and undeployed when necessary. In order to reduce the overhead caused by HDDA, the Average Latency Ratio Minimum (ALR-MIN) replacement strategy is also proposed. It deploys applications to nodes with minimum ALR of Node (NALR), and evicts applications with minimum increment of ALR. The results of the experiment we conducted on ChinaGrid show that HDDA can achieve 10 and 24% less average complete time (ACT) than the schemes of non-HDDA and Static Deployment of Application (SDA), respectively. Additionally, throughput and load balancing of HDDA are also better than the other two schemas. Results of the simulation performed on a simulator particularly developed for this research show that our ALR-MIN replacement strategy results in 17% less relative delay-time of jobs than the well-known Least Recently Used (LRU)-based strategies in a typical setting.

show abstract

Section: Dynamic Deploymentmentioning

confidence: 99%

mentioning

confidence: 99%

Improving grid performance by dynamically deploying applications

Chen

Liu

et al. 2010

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The mapping from AFs to ATs and further to ADs are done automatically by the ASKALON runtime system. For details, readers may refer to our previous work [26] and [29]. The Abstract Grid Workflow Ontologies (AGWO) [26] are a set of ontologies used to describe AFs.…”

Section: Agwlmentioning

confidence: 99%

A novel graph based approach for automatic composition of high quality grid workflows

Qin

Fahringer

Prodan

2009

Proceedings of the 18th ACM International Symposium on High Performance Distributed Computing

View full text Add to dashboard Cite

The workflow paradigm is one of the most important programming models for the Grid. The composition of Grid workflows has been widely studied in the Grid community. However, there is still a lack of a general and efficient approach for automatic composition of Grid workflows. In this paper, we present a STRIPS (Stanford Research Institute Problem Solver) based formal definition of the Grid workflow composition problem, followed by a novel graph based algorithm for automatic composition of high quality (portable, fault tolerant and optimized) Grid workflows. Our algorithm searches for semantic descriptions of workflow activities, i.e., Activity Functions (AFs), defined by ontologies and composes them into Grid workflows using AF Data Dependence (ADD) graphs. The composition process consists of three phases: ADD graph creation, workflow extraction, and workflow optimization. The worst case complexity of our algorithm is quadratic in the number of AFs. An extension of our algorithm to compose Grid workflows with branches and loops is also presented. Experimental results illustrate the effectiveness and efficiency of our approach: (i) the measured worst case execution time of our algorithm further proofs the analyzed time complexity; (ii) the composition of the real world meteorology Grid workflow application MeteoAG with our algorithm takes approximate half a second; and (iii) the execution time of the MeteoAG workflow when running on the Austrian Grid is reduced by up to 25% and the speedup is increased by up to 2.24 by applying our workflow optimization techniques.

show abstract

“…The Resource Manager renders the boundaries of Grid resource management and brokerage and provides Grid resource discovery, advanced reservation and virtual organization-wide authorization along with a dynamic registration framework for the Grid activities [19], [20]. The Resource Manager covers both physical resources, including processors, storage devices, and network interconnections, as well as logical resources comprising Grid/Web services and executables.…”

Section: Resource Managermentioning

confidence: 99%

“…Counter). We have used two methods to perform the automatic deployment: 1) Globus, using the GridFTP protocol [12] to remotely transfer and the Globus Resource Allocation Manager (GRAM) [12] to remotely deploy the code; 2) Expect, by programmatically acquiring local shell on a target site and automatizing the installation [20]. Table II illustrates the overheads associated with different deployment operations.…”

Section: Resource Managermentioning

confidence: 99%

ASKALON: a Grid application development and computing environment

Fahringer

Prodan

Duan

et al. 2005

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

Self Cite

148

View full text Add to dashboard Cite

Abstract-We present the ASKALON environment whose goal is to simplify the development and execution of workflow applications on the Grid. ASKALON is centered around a set of high-level services for transparent and effective Grid access, including a Scheduler for optimized mapping of workflows onto the Grid, an Enactment Engine for reliable application execution, a Resource Manager covering both computers and application components, and a Performance Prediction service based on training phase and statistical methods. A sophisticated XMLbased programming interface that shields the user from the Grid middleware details allows the high-level composition of workflow applications. ASKALON is used to develop and port scientific applications as workflows in the Austrian Grid project. We present experimental results using two real-world scientific applications to demonstrate the effectiveness of our approach.

show abstract

GLARE: A Grid Activity Registration, Deployment and Provisioning Framework

Cited by 33 publications

References 12 publications

Improving grid performance by dynamically deploying applications

Improving grid performance by dynamically deploying applications

A novel graph based approach for automatic composition of high quality grid workflows

ASKALON: a Grid application development and computing environment

Contact Info

Product

Resources

About