A Flexible Framework for Fault Tolerance in the Grid

Hwang, Soonwook; Kesselman, Carl

doi:10.1023/b:grid.0000035187.54694.75

Cited by 124 publications

(70 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We have demonstrated it in the paper. Third, compared to the other Grid service interfaced workflow engines, e.g., GridWorkflow [12], VLAM-G engine takes one step further and makes the implementation based on GT4.…”

Section: Discussionmentioning

confidence: 99%

WS-VLAM: A GT4 Based Workflow Management System

Wibisono

Vasyunin

Korkhov

et al. 2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

Abstract. Generic Grid middleware, e.g., Globus Toolkit 4 (GT4), provides basic services for scientific workflow management systems to discover, store and integrate workflow components. Using the state of the art Grid services can advance the functionality of workflow engine in orchestrating distributed Grid resources. In this paper, we present our work on migrating VLAM-G, a Grid workflow engine based on GT2 to GT4. We discuss how we use the rich set of services provided by GT4 in the new design to realize the user interactivity, interoperability and monitoring. The experiment results show that use cases from previous systems can be migrated seamlessly into the new architecture.

show abstract

Section: Discussionmentioning

confidence: 99%

WS-VLAM: A GT4 Based Workflow Management System

Wibisono

Vasyunin

Korkhov

et al. 2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

show abstract

“…An architectural framework for access control to grid resources can be found in the work of Laccetti and Schmidb (2007), where the extension of the authentication and authorization features the OS layer is proposed. Hwang and Kesselman (2003) proposed a failure detection service and a failure handling mechanism, which enable the detection of both task failures and user secure requirements without the need for updating the grid protocol and the local policy at the Grid node. Brandic et al (2006) addressed the security aspect of a Quality of Service (QoS) requirement defined by grid users at workflow specification time.…”

Section: Related Workmentioning

confidence: 99%

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

Kołodziej¹,

Xhafa²

2011

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies, user privileges, etc. On the other, CGs have hierarchical nature and therefore any computational model should be able to effectively express the hierarchical architecture in the optimization model. Recently, researchers have been investigating the use of game theory for modeling user requirements regarding task and resource allocation in grid scheduling problems. In this paper we present two general non-cooperative game approaches, namely, the symmetric non-zero sum game and the asymmetric Stackelberg game for modeling grid user behavior defined as user requirements. In our game-theoretic approaches we are able to cast new requirements arising in allocation problems, such as asymmetric users relations, security and reliability restrictions in CGs. For solving the games, we designed and implemented GA-based hybrid schedulers for approximating the equilibrium points for both games. The proposed hybrid resolution methods are experimentally evaluated through the grid simulator under heterogeneity, and large-scale and dynamics conditions. The relative performance of the schedulers is measured in terms of the makespan and flowtime metrics. The experimental analysis showed high efficiency of meta-heuristics in solving the game-based models, especially in the case of an additional cost of secure task scheduling to be paid by the users.

show abstract

“…The system in [12] relies on information from a resource broker, but it can also be combined with heartbeat monitors. Pierre [21] utilizes the peer-topeer (P2P) technologies to perform node management in a decentralized manner.…”

Section: Related Workmentioning

confidence: 99%