A Minimum Proportional Time Redundancy based Checkpoint Selection Strategy for Dynamic Verification of Fixed-time Constraints in Grid Workflow Systems

Authors:
Jinjun Chen;Yun Yang
Affiliations:
Swinburne University of Technology, Australia;Swinburne University of Technology, Australi
Venue:
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Year:
2005

Citing 0
Cited 5

Key research issues in grid workflow verification and validation

ACSW Frontiers '06 Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54
Adaptive selection of necessary and sufficient checkpoints for dynamic verification of temporal constraints in grid workflow systems

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Temporal dependency based checkpoint selection for dynamic verification of fixed-time constraints in grid workflow systems

Proceedings of the 30th international conference on Software engineering
Temporal dependency-based checkpoint selection for dynamic verification of temporal constraints in scientific workflow systems

ACM Transactions on Software Engineering and Methodology (TOSEM)
Selecting necessary and sufficient checkpoints for dynamic verification of fixed-time constraints in grid workflow systems

BPM'06 Proceedings of the 4th international conference on Business Process Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In grid workflow systems, existing typical checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, are not effective and/or efficient for fixed-time constraint verification because they often ignore some necessary checkpoints and select some unnecessary checkpoints. To improve such status, in this paper, we develop a new checkpoint selection strategy. Specifically, we first address a new concept of minimum proportional time redundancy which can be used to tolerate certain time deviation incurred by abnormal grid workflow execution. Then, we discuss relationships between minimum proportional time redundancy and fixed-time constraint consistency. Based on the relationships, we present our new strategy. With the strategy, we can avoid the omission of necessary checkpoints and the selection of excess unnecessary checkpoints. Consequently, our strategy is more effective and efficient for fixed-time constraint verification than the existing typical strategies. The final evaluation further demonstrates this result.