Grid services adaptation in a grid workflow

Authors:
Wencai Guo;Yang Yang;Zhengli Zhai
Affiliations:
School of information engineering, University of Science and Technology Beijing, Beijing, P.R. China;School of information engineering, University of Science and Technology Beijing, Beijing, P.R. China;School of information engineering, University of Science and Technology Beijing, Beijing, P.R. China
Venue:
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Year:
2005

Citing 10
Cited 0

Communicating sequential processes

Communicating sequential processes
A calculus of mobile processes, I

Information and Computation
Protocol specifications and component adaptors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Coordinating interaction patterns

Proceedings of the 2001 ACM symposium on Applied computing
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Merging the CCA Component Model with the OGSI Framework

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Component-based workflow systems development

Decision Support Systems
A formal approach to component adaptation

Journal of Systems and Software - Special issue: Automated component-based software engineering
The Future Interconnection Environment

Computer
Formalizing Web Service Choreographies

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.03

Visualization

Abstract

At present the grid workflow is a focus topic in the research on grid technologies, but few approaches are provided for designing and checking the grid services adaptation in a workflow, especially in a formal way. As a mobile process algebra, Pi-Calculus is suitable tool for modeling and analyzing distributed, concurrent and dynamic system, such as grid workflow. Addressing the protocol level deadlock, a grid service adaptor is proposed with the Pi-Calculus based Grid Services Deadlock Eliminating algorithm. Through analyzing the experiment results the algorithm proves to be available and useful for service adaptation. As a conclusion the future research work is also discussed.