Flexible temporal consistency for fixed-time constraint verification 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), 2005, 3795 LNCS pp. 300 - 311
- Issue Date:
- 2005-12-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2012007125OK.pdf | 372.17 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
To verify fixed-time constraints in grid workflow systems, the consistency and inconsistency conditions have been defined in the conventional work. However, in this paper, we argue that although the conventional consistency condition is reasonable, the conventional inconsistency condition is too rigorous and covers several different situations. These situations which are handled conventionally by the same exception handling should be handled differently for cost saving. Therefore, we divide the conventional inconsistency into weak consistency, weak inconsistency and strong inconsistency and treat the conventional consistency as strong consistency. Correspondingly, we discuss how to verify them. Especially, for the weak consistency, we present a method on how to adjust it to the strong consistency. For the weak inconsistency, we analyse why it can be handled by simpler and more economical exception handling. The final comparison and discussion further demonstrate that our research can achieve better cost effectiveness than the conventional work. © Springer-Verlag Berlin Heidelberg 2005.
Please use this identifier to cite or link to this item: