27.03.2014 Views

SEKE 2012 Proceedings - Knowledge Systems Institute

SEKE 2012 Proceedings - Knowledge Systems Institute

SEKE 2012 Proceedings - Knowledge Systems Institute

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

eventually triggers a co mmon task. Fig. 3 shows an<br />

example of a procedural branch, a PS-block and a n ESblock.<br />

A well-nested workflow is recursively defined as<br />

following:<br />

1. A procedural branch is said to be a well-nested<br />

workflow.<br />

2. A workflow resulted from replacing a tas k in a<br />

well-nested workflow with a f ork-join block is<br />

also a well-nested workflow<br />

Fig. 4 shows three well-nested workflows and their<br />

relationship.<br />

TS 1<br />

TS 2<br />

TS 100<br />

TS 1<br />

TS 21<br />

TS 22 TS 23<br />

TS 200<br />

TS 100<br />

(a)<br />

(b)<br />

TS 1<br />

(a)<br />

TS 21<br />

TS 221 TS 231<br />

TS 222 TS 223 TS 232 TS 233<br />

(b)<br />

TS 220<br />

TS 230<br />

TS 200<br />

TS 100<br />

(c)<br />

Fig. 3. (a) A procedural branch. (b) A PS-block.<br />

(c) An ES-block<br />

C. Resource Analysis<br />

The purpose of resource analysis is to track the<br />

maximum resource consumption of each type of resource<br />

during the workflow execution by structurally traversing<br />

each branch of the workflow from the start task to end task.<br />

A workflow’s maximum resource consumption (MRC)<br />

is, for each type of resources, the minimum amount of the<br />

resource that allows the workflow to complete its<br />

execution along all possible execution paths.<br />

(c)<br />

Fig. 4. (a) A three-task procedural workflow.<br />

(b) The middle task in (a) is replaced with an ES-block.<br />

(c) One task in (b) is replaced with and<br />

MRC analysis for a well-nested workflow is mainly<br />

based on the analysis of a procedural branch. Con sider a<br />

procedural branch constituting of tasks TS 1 , TS 2 , …, TS n ,<br />

sequentially. In order to execu te TS 1 , the requirement on<br />

resource r i is:<br />

r i + (TS 1 );<br />

In order to execute T 2 , the requirement on resource r i is:<br />

r i + (TS 2 ) + r i + (TS 1 ) + r i - (TS 1 );<br />

384

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!