By Topic

Analysis for instances' staying-time distribution in the workflow

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liu Sheng ; Shenyang Inst. of Autom., Chinese Acad. of Sci., Shenyang, China ; Fan Yushun

Many workflow applications have time constraints. The serving time of the servers and the arrival intervals of users' service requests in a workflow are often stochastic. From the statistic angle, we can find a tiny proportion of service requests will be executed beyond the deadline in any case. Thus people can only require an acceptable proportion of service requests to be finished within the deadline normally. We try to determine its probability density function at a workflow network so that we will know the accurate proportion of requests that can be executed without delay. We also present a method to improve the proportion of the undelayed with the lowest additional cost. An experiment illustrates our method can be effectively utilized in practice

Published in:

2005 IEEE International Conference on Industrial Technology

Date of Conference:

14-17 Dec. 2005