Chapter

Grid and Cooperative Computing - GCC 2005

Volume 3795 of the series Lecture Notes in Computer Science pp 300-311

Flexible Temporal Consistency for Fixed-Time Constraint Verification in Grid Workflow Systems

  • Jinjun ChenAffiliated withCICEC – Centre for Internet Computing and E-Commerce, Faculty of Information and Communication Technologies, Swinburne University of Technology
  • , Yun YangAffiliated withCICEC – Centre for Internet Computing and E-Commerce, Faculty of Information and Communication Technologies, Swinburne University of Technology

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.