Table 15 Key notation definitions.
From: Multi-objective and multi constrained task scheduling framework for computational grids
Notation | Description |
|---|---|
n | Number of tasks |
m | Number of Grids present on the grid network |
\(W_{T_i}\) | Length (in millions of instructions) of task \(T_i\) |
\(W_{G_j}\) | Processing Capacity in MIPS (millions of instructions per second) of a single machine belonging to Grid \(G_j\) |
p[1, ..., m] | Number of machines present on Grids \(G_1,..., G_m\) |
\(Price_{E_{G_j}}\) | Price (cost) incurred per second in executing a task on any machine belonging to Grid \(G_j\) |
\(Price_{C}\) | Price(cost) incurred per second in reserving the network link connecting any two different Grids on the Grid Network |
\(d^+(T_i)\) | Out degree of Task \(T_i\) on the task dependency graph i.e. the number of child tasks dependent on Task \(T_i\) |
GS | Greedy scheduler - Minimize TAT and maximize Resource Utilization |
GCPS | Greedy communication price scheduler - Minimize the communication Price (Cost) |
GEPS | Greedy execution price scheduler - Minimize the execution Price (Cost) |
GNFS | Greedy No-Fragmentation scheduler - Minimize TAT and maximize Resource Utilization without fragmenting any task across multiple Grid-Machines |
R | Random scheduler |
