Improving the performance of time-constrained workflow processing
J. SON, and M. KIM. The Journal of Systems and Software, (2001)
Abstract
Many workflow applications often have timing constraints such that
each processing of a workflow needs to be finished within its deadline.
The objective is to address a wuitable scheme that can maximize the
number of workflow instances satisfying the given deadline. They
first present a method to find out a set of critical activities where
a critical activity is the one whose delay of completion directly
affects the overall processing time of a workflow. Since each critical
activity have a certain number of serevers for the sufficient processing
capacity, we then develop a method to determine the minimun number
os servers for the critical activity such that this activity should
be finished without delay for a given input arrival rate.
%0 Journal Article
%1 Son2001
%A SON, J. H.
%A KIM, M. H.
%D 2001
%J The Journal of Systems and Software
%K constraints, management model queueing system, time workflow workflow,
%P 211-219
%T Improving the performance of time-constrained workflow processing
%V 58
%X Many workflow applications often have timing constraints such that
each processing of a workflow needs to be finished within its deadline.
The objective is to address a wuitable scheme that can maximize the
number of workflow instances satisfying the given deadline. They
first present a method to find out a set of critical activities where
a critical activity is the one whose delay of completion directly
affects the overall processing time of a workflow. Since each critical
activity have a certain number of serevers for the sufficient processing
capacity, we then develop a method to determine the minimun number
os servers for the critical activity such that this activity should
be finished without delay for a given input arrival rate.
@article{Son2001,
abstract = {Many workflow applications often have timing constraints such that
each processing of a workflow needs to be finished within its deadline.
The objective is to address a wuitable scheme that can maximize the
number of workflow instances satisfying the given deadline. They
first present a method to find out a set of critical activities where
a critical activity is the one whose delay of completion directly
affects the overall processing time of a workflow. Since each critical
activity have a certain number of serevers for the sufficient processing
capacity, we then develop a method to determine the minimun number
os servers for the critical activity such that this activity should
be finished without delay for a given input arrival rate.},
added-at = {2011-08-05T23:54:50.000+0200},
author = {SON, J. H. and KIM, M. H.},
biburl = {https://www.bibsonomy.org/bibtex/2f8c2c3339ba60ba02eb558e9e3d77212/lgmarujo},
file = {:PhD Files\\Process Modeling\\Son_Kim Improv Perform time-constr workflow
JSysSoft 58 2001.pdf:PDF},
interhash = {6cefbd048f8a4747bba185c43b16756d},
intrahash = {f8c2c3339ba60ba02eb558e9e3d77212},
journal = {The Journal of Systems and Software},
keywords = {constraints, management model queueing system, time workflow workflow,},
owner = {Lino},
pages = {211-219},
timestamp = {2011-08-05T23:54:51.000+0200},
title = {Improving the performance of time-constrained workflow processing},
volume = 58,
year = 2001
}