21.01.2014 Views

Xiao Liu PhD Thesis.pdf - Faculty of Information and Communication ...

Xiao Liu PhD Thesis.pdf - Faculty of Information and Communication ...

Xiao Liu PhD Thesis.pdf - Faculty of Information and Communication ...

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.

also mentions a type <strong>of</strong> static activity point which is defined by users at the buildtime<br />

stage. The work in [23] selects an activity as a checkpoint if its execution time<br />

exceeds the maximum duration while the work in [20] selects an activity as a<br />

checkpoint if its execution time exceeds the mean duration. The state-<strong>of</strong>-the-art<br />

checkpoint selection which satisfies the property <strong>of</strong> necessity <strong>and</strong> sufficiency is<br />

proposed in [21] where minimum time redundancies for SC (Strong Consistency)<br />

<strong>and</strong> WC (Weak Consistency) are defined. For example, an activity point is selected<br />

as a WC checkpoint if <strong>and</strong> only if its execution time is larger than the sum <strong>of</strong> its<br />

mean duration <strong>and</strong> its minimum WC time redundancy. The comparison result shows<br />

that with the measurement <strong>of</strong> necessity <strong>and</strong> sufficiency, the one based on minimum<br />

time redundancy has outperformed all the other checkpoint selection strategies.<br />

Based on the minimum time redundancy based checkpoint selection strategies,<br />

the work in [20, 22] further improves the efficiency <strong>of</strong> temporal verification by<br />

utilising the temporal dependency between temporal constraints. The basic idea is<br />

that with temporal dependency, the consistency <strong>of</strong> some later fixed-time constraints<br />

can be deduced from previous ones. Then, based on temporal dependency,<br />

was presented. With<br />

CSS TD<br />

CSS TD<br />

, those subsequent fixed-time constraints whose<br />

consistency can be deduced from previous ones will no longer take any checkpoints.<br />

Accordingly, their verification can be avoided which otherwise incurred by other<br />

strategies.<br />

6.1.2 Problem Analysis<br />

In order to save the overall cost, the practice <strong>of</strong> temporal violation h<strong>and</strong>ling is to<br />

compensate the time deficits by light-weight (small time overheads <strong>and</strong> monetary<br />

cost) violation h<strong>and</strong>ling strategies as much as possible instead <strong>of</strong> conventional<br />

expensive heavy-weight temporal violation h<strong>and</strong>ling strategies such as resource<br />

recruitment <strong>and</strong> workflow restructure, except for severe temporal violations with<br />

excessively large time deficits. Therefore, in this chapter, the range <strong>of</strong> temporal<br />

consistency states where light-weight temporal violation h<strong>and</strong>ling is effective needs<br />

to be determined first, then statistically recoverable temporal violations can be<br />

detected <strong>and</strong> h<strong>and</strong>led at the early stage before they become severe or unrecoverable<br />

(unrecoverable with light-weight temporal violation h<strong>and</strong>ling) temporal violations.<br />

92

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

Saved successfully!

Ooh no, something went wrong!