Proceedings of the 30th international conference on Software engineering
International Journal of High Performance Computing Applications
WE-AMBLE: a Workflow Engine To Manage Awareness in Collaborative Grid Environments
International Journal of High Performance Computing Applications
Grid-Enabled Workflow Management System Based On BPEL
International Journal of High Performance Computing Applications
International Journal of High Performance Computing Applications
Flexible and Efficient Workflow Deployment of Data-Intensive Applications On Grids With MOTEUR
International Journal of High Performance Computing Applications
International Journal of High Performance Computing Applications
A Workflow Engine-Driven SOA-Based Cooperative Computing Paradigm in Grid Environments
International Journal of High Performance Computing Applications
Grid workflows specification and verification
WSEAS Transactions on Computers
A Probabilistic Strategy for Setting Temporal Constraints in Scientific Workflows
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Verification of grid workflows
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Localising temporal constraints in scientific workflows
Journal of Computer and System Sciences
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Journal of Systems and Software
BPM'06 Proceedings of the 4th international conference on Business Process Management
Journal of Computer Science and Technology - Special issue on Natural Language Processing
Managing large numbers of business processes with cloud workflow systems
AusPDC '12 Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127
Do we need to handle every temporal violation in scientific workflow systems?
ACM Transactions on Software Engineering and Methodology (TOSEM)
Hi-index | 0.00 |
To verify fixed-time constraints in Grid workflow systems, consistency and inconsistency conditions have been defined in conventional verification work. However, with a view of the run-time uncertainty of activity completion duration, we argue that, although the conventional consistency condition is feasible, the conventional inconsistency condition is too restrictive and covers several different states. These states, which are handled conventionally by the same exception handling, should be handled differently for the purpose of cost saving. Therefore, in this paper, we divide conventional inconsistency into weak consistency, weak inconsistency and strong inconsistency and treat conventional consistency as strong consistency. Correspondingly, we develop some algorithms on how to verify them. Based on this, for weak consistency we present a method on how to adjust it to strong consistency by using mean activity time redundancy and temporal dependency between fixed-time constraints. For weak inconsistency, we analyse briefly why it can be handled by simpler and more cost-saving exception handling while for strong inconsistency, the conventional exception handling remains deployed. The final quantitative evaluation demonstrates that our research can achieve better cost-effectiveness than the conventional work. Copyright © 2006 John Wiley & Sons, Ltd.