Do We Need to Handle Every Temporal Violation in Scientific Workflow Systems?

被引:58
作者
Liu, Xiao [1 ,2 ]
Yang, Yun [2 ,3 ]
Yuan, Dong [2 ]
Chen, Jinjun [4 ]
机构
[1] E China Normal Univ, Shanghai Key Lab Trustworthy Comp, Inst Software Engn, Shanghai 200062, Peoples R China
[2] Swinburne Univ Technol, Sch Software & Elect Engn, Melbourne, Vic 3122, Australia
[3] Anhui Univ, Sch Comp Sci & Technol, Hefei 230039, Peoples R China
[4] Univ Technol Sydney, Fac Engn & Informat Technol, Sydney, NSW 2007, Australia
基金
澳大利亚研究理事会;
关键词
Algorithms; Performance; Reliability; Verification; Scientific workflows; temporal constraints; temporal verification; violation handling point selection; quality of service; DYNAMIC VERIFICATION; CONSTRAINTS; TAXONOMY;
D O I
10.1145/2559938
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Scientific processes are usually time constrained with overall deadlines and local milestones. In scientific workflow systems, due to the dynamic nature of the underlying computing infrastructures such as grid and cloud, execution delays often take place and result in a large number of temporal violations. Since temporal violation handling is expensive in terms of both monetary costs and time overheads, an essential question aroused is "do we need to handle every temporal violation in scientific workflow systems?" The answer would be "true" according to existing works on workflow temporal management which adopt the philosophy similar to the handling of functional exceptions, that is, every temporal violation should be handled whenever it is detected. However, based on our observation, the phenomenon of self-recovery where execution delays can be automatically compensated for by the saved execution time of subsequent workflow activities has been entirely overlooked. Therefore, considering the nonfunctional nature of temporal violations, our answer is "not necessarily true." To take advantage of self-recovery, this article proposes a novel adaptive temporal violation handling point selection strategy where this phenomenon is effectively utilised to avoid unnecessary temporal violation handling. Based on simulations of both real-world scientific workflows and randomly generated test cases, the experimental results demonstrate that our strategy can significantly reduce the cost on temporal violation handling by over 96% while maintaining extreme low violation rate under normal circumstances.
引用
收藏
页数:34
相关论文
共 43 条
  • [31] Temporal constraints: a survey
    Schwalb, Eddie
    Vila, Lluís
    [J]. Constraints, 1998, 3 (2-3) : 129 - 149
  • [32] SECES, 2008, P 1 INT WORKSH SOFTW
  • [33] Sommerville Ian, 2009, SOFTWARE ENG
  • [34] Stroud K.A., 2007, Engineering Mathematics
  • [35] van der Aalst W.M.P., 2002, Workflow management: models, methods, and systems
  • [36] Analysis of discrete-time stochastic Petri nets
    van der Aalst, WMP
    van Hee, KM
    Reijers, HA
    [J]. STATISTICA NEERLANDICA, 2000, 54 (02) : 237 - 255
  • [37] Xiao JC, 2010, LECT NOTES COMPUT SC, V6013, P107, DOI 10.1007/978-3-642-12029-9_8
  • [38] Xiao Liu, 2010, Proceedings 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid), P534, DOI 10.1109/CCGRID.2010.15
  • [39] YANG Y, 2007, GRID COMPUTING, P51, DOI DOI 10.1109/E-SCIENCE.2007.2
  • [40] Yu J, 2005, Journal of Grid Computing, V3, P171, DOI [10.1007/s10723-005-9010-8, DOI 10.1007/S10723-005-9010-8]