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.

violation h<strong>and</strong>ling strategies in the scientific workflow systems to address the<br />

violations <strong>of</strong> QoS constraints [100, 101]. Workflow local rescheduling is to<br />

compensate for the time deficit by rescheduling some subsequent activities after the<br />

h<strong>and</strong>ling point in a local workflow segment to reduce their scheduled execution time<br />

(detailed in Section 8.3). In this chapter, since we focus on checkpoint selection <strong>and</strong><br />

temporal verification, instead <strong>of</strong> applying a specific workflow rescheduling strategy,<br />

a pseudo-rescheduling strategy with a reasonable average time compensation rate<br />

(i.e. the reduced rate <strong>of</strong> the scheduled execution time for the subsequent activities) <strong>of</strong><br />

50% is applied to represent the average performance <strong>of</strong> representative rescheduling<br />

strategies [56, 100] (detailed in Section 8.5). The size <strong>of</strong> rescheduled workflow<br />

activities, i.e. the number <strong>of</strong> subsequent activities which need to be rescheduled, is<br />

r<strong>and</strong>omly selected up to 5 which is normally large enough to compensate for time<br />

deficit with the given compensation rate. In the real world, not every workflow<br />

rescheduling can be successful (for example, when the current workload is<br />

extremely high). Therefore, we set 80% as the success rate for temporal violation<br />

h<strong>and</strong>ling.<br />

CSS TD is applied with default settings as defined in [22].<br />

6.3.2 Experimental Results<br />

Here, we demonstrate the experiments on checkpoint selection. The number <strong>of</strong><br />

selected checkpoints is recorded for every experiment. However, for the ease <strong>of</strong><br />

discussion without losing generality, we will only demonstrate the results in<br />

COM(1.28), i.e. with 90% initial probability temporal consistency state. More<br />

experimental results <strong>and</strong> supplement material could be found online 5 . Since the<br />

necessity <strong>and</strong> sufficiency <strong>of</strong> our checkpoint selection strategy have already been<br />

proved in Section 6.2.3, the experiment here is mainly to verify the effectiveness <strong>of</strong><br />

our strategy in different system environments. Therefore, additional experiment<br />

settings have been implemented. Firstly, we demonstrate the results with different<br />

noises. Embedding noises is to artificially increase the duration <strong>of</strong> a r<strong>and</strong>omly<br />

selected activity. The purpose <strong>of</strong> embedded noises is to simulate the system<br />

environments where unexpected delays <strong>of</strong>ten take place. Meanwhile, noises can also<br />

simulate estimation errors such as those brought by the two assumptions (e.g. non-<br />

5 http://www.ict.swin.edu.au/personal/xliu/doc/CheckpointSelection.rar<br />

100

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

Saved successfully!

Ooh no, something went wrong!