Title: An efficient temporal verification algorithm for intersectant constraints in scientific workflow

Authors: Lei Wu; Longshu Li; Xuejun Li; Futian Wang; Yun Yang

Addresses: School of Computer Science and Technology, Anhui University, Anhui Hefei 230601, China ' School of Computer Science and Technology, Anhui University, Anhui Hefei 230601, China ' School of Computer Science and Technology, Anhui University, Anhui Hefei 230601, China ' School of Computer Science and Technology, Anhui University, Anhui Hefei 230601, China ' School of Software and Electrical Engineering, Swinburne University of Technology, Melbourne, Australia

Abstract: It is usually essential to conduct temporal verification in order to ensure overall temporal correctness for the usefulness of execution results in a scientific workflow. For improving the efficiency of temporal verification, many efforts have been dedicated to the selection of more effective and efficient checkpoints along scientific workflow execution so that temporal violations can be found and handled in time. Most of checkpoint selection strategies involve temporal constraints, but the relations among the temporal constraints have been ignored. The only existing strategy considering relations among temporal constraints is for the nested situation and temporal dependency based only. However, the intersectant situation and non-dependency relationship of temporal constraints have to be considered. In this paper, a constraint adjustment strategy-based algorithm for efficient temporal verification in scientific workflow involved in both temporal dependency and temporal reverse-dependency is presented for the intersectant situation. Simulations show that the temporal verification efficiency of our algorithm is significantly improved.

Keywords: scientific workflow; temporal verification; temporal constraint; temporal consistency; intersectant situation; temporal dependency; temporal reverse-dependency.

DOI: 10.1504/IJHPCN.2019.102130

International Journal of High Performance Computing and Networking, 2019 Vol.14 No.3, pp.304 - 314

Received: 18 Apr 2017
Accepted: 02 Dec 2017

Published online: 03 Sep 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article