DARPA ULTRALOG Final Report - Industrial and Manufacturing ...

Manuscript for IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 18
CPU is allocated using a weighted round-robin scheduling in which CPU time received by each
component in a round is equal to its assigned weight.
N 1 N 2 N 3
N 4
A 1 A 2
A 3 A 4
N 5
A 5 A 6
N 6
A 7 A 8
A 9 A 10 A 11 A 12 A 13 A 14 A 15 A 16
200 200 200 200 400 400 400 400
N 7
Fig. 2. Experimental network configuration
We set up six different experimental conditions as shown in Table 1. We vary the cost of
completion time and the distribution of CPU time can be deterministic or exponential. While
using stochastic value function we repeat 5 experiments. QoS UB is calculated from (14) with t=0
for each condition as shown in the table.
Table 1. Experimental conditions
Condition CCT(T) f i (v i ) QoS UB
Con1-1 0.5T Deterministic 30000
Con1-2 0.5T Exponential 30000
Con2-1 1.5T Deterministic 19200
Con2-2 1.5T Exponential 19200
Con3-1 2.5T Deterministic 12000
Con3-2 2.5T Exponential 12000
We use ten different control policies for each experimental condition as shown in Table 2.
First eight control policies (FX-XX) use fixed value modes over time. In predictive control
policies (PC-XX) components selects value modes by solving the optimization model in (14). In
round-robin resource allocation (XX-RR) the components in each node are assigned equal