Analysis for instances' staying-time distribution in the workflow

Abstract

Performance analysis can help us reduce requests' congestions in a workflow network, cut servers' cost or strike a best balance between them. Analysis for requests' remaining time at a workflow network plays an important role in the per-formance analysis for time-constrained workflow. Because requests' remaining time has complex relations with the arrival rate of users' service requests, the service rate of each server for each activity, servers' number and the structure of the workflow network, it is difficult to give a quantificational analysis for requests' remaining time. We develop a method to determine probability density function of requests' remaining time at a workflow network so that we will know the accurate proportion of requests can be executed without delay. An experiment illustrates our method can be effectively utilized in practice.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.1117/12.664617 under the license https://creativecommons.org/licenses/by-nc-sa

• http://ir.sia.cn//bitstream/173321/8217/2/HYQW000297.pdf

• https://core.ac.uk/display/150112284,

https://ui.adsabs.harvard.edu/abs/2005SPIE.6042E..1KL/abstract,

https://www.spiedigitallibrary.org/conference-proceedings-of-spie/6042/1/Analysis-for-instances-staying-time-distribution-in-the-workflow/10.1117/12.664617.full,

https://academic.microsoft.com/#/detail/2035917339 under the license cc-by-nc-sa