Speculative Scheduling of Parameter Sweep Applications Using Job Behaviour Descriptions - Cloud, Grid and High Performance Computing: Emerging Applications - page 79

Algorithm 1. Example job behaviour description

<file type=”in” name=”test1” access_ratio=”1.47218” intersection_ratio=”0.18”>
<sequential>
<datablock
min_pos_absolute=”0” max_pos_absolute=”24000”
min_pos_relative=”0” max_pos_relative=”0.24”
step=”2000” size=”1000” />
<timing
op_time=”1” op_mips=”4.341”
avg_op_time=”8” avg_op_mips=”34.728” />
</sequential>
<sequential>
<datablock
min_pos_absolute=”25000” max_pos_absolute=”49000”
min_pos_relative=”0.25” max_pos_relative=”0.49”
step=”2000” size=”2000” />
<timing
op_time=”1” op_mips=”4.341”
avg_op_time=”15” avg_op_mips=”65.115” />
</sequential>
<random>
<area
lower_bound_absolute=”50000” upper_bound_absolute=”100000”
lower_bound_relative=”0.5” upper_bound_relative=”1”
access_ratio=”2.19436” intersection_ratio=”0.36”
avg_size=”3300” />
<timing avg_op_time=”39” avg_op_mips=”169.299” />
</random>
</file>

between two consecutive operations.
In the case of the sequential access
method the timing specification also
contains the minimum system and
CPU time. The latter has significance
in the case of dynamic scheduling
and replication.

bytes (skipping the following 1000 bytes); in the
second part the application reads sequentially
blocks of 2000 bytes; in the third part the applica-
tion reads the blocks randomly.

Complex Description

A complex job description is a set of simple de-
scriptions relating to the same job (see below).
Each member description has a weight attribute,
which specifies how many times the given member
description reflected the actual job behaviour.

The job description example of Algorithm 1
depicts the data access pattern generated for an
application that reads file “test1”: in the first part
the application reads sequentially blocks of 1000