Selecting necessary and sufficient checkpoints for dynamic verification of fixed-time constraints in grid workflow systems

Publication Type:
Journal Article
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006, 4102 LNCS pp. 445 - 450
Issue Date:
2006-01-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2012007126OK.pdf233.83 kB
Adobe PDF
In grid workflow systems, existing representative checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, often select some unnecessary checkpoints and ignore some necessary ones. Consequently, overall temporal verification efficiency and effectiveness can be severely impacted. In this paper, we propose a new strategy that selects only necessary and sufficient checkpoints dynamically along grid workflow execution. Specifically, we introduce a new concept of minimum time redundancy as a key reference value for checkpoint selection. We also investigate its relationships with fixed-time constraint consistency. Based on these relationships, we present our strategy which can improve overall temporal verification efficiency and effectiveness significantly. © Springer-Verlag Berlin Heidelberg 2006.
Please use this identifier to cite or link to this item: