Share Email Print

Proceedings Paper

Analysis for instances' staying-time distribution in the workflow
Author(s): Sheng Liu; Yushun Fan; Shijie Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 2 May 2006
PDF: 7 pages
Proc. SPIE 6042, ICMIT 2005: Control Systems and Robotics, 60421K (2 May 2006); doi: 10.1117/12.664617
Show Author Affiliations
Sheng Liu, Shenyang Institute of Automation, CAS (China)
Yushun Fan, Tsinghua Univ. (China)
Shijie Zhang, Shenyang Institute of Automation, CAS (China)

Published in SPIE Proceedings Vol. 6042:
ICMIT 2005: Control Systems and Robotics
Yunlong Wei; Kil To Chong; Takayuki Takahashi; Shengping Liu; Zushu Li; Zhongwei Jiang; Jin Young Choi, Editor(s)

© SPIE. Terms of Use
Back to Top