MIRI. SMDE. Academic year 2012-13.

Q1
1 Statistics
We want to predict the behavior of a computer using our new and amazing algorithm.
The time needed to complete the process depends on the complexity (in Mb) of the
input. In the next table we show this relation.

Mb
10
10
15
16
12
14
9
6
7
8

Time
1
1,5
8
8,1
7
6
5
3
3,5
3,8

What could be the expected time to complete the process for an input of a complexity of
50Mb? Justify your answers and depict all the process.

Mb
10
10
15
16
12
14

Time
1
1,5
8
8,1
7
6

Xi-X

yi-y

Sxy

S2x

-0,7

-3,69

2,583

0,49

-0,7

-3,19

2,233

0,49

4,3

3,31

14,233

18,49

5,3

3,41

18,073

28,09

1,3

2,31

3,003

1,69

3,3

1,31

4,323

10,89

9
6
7
8

5
3
3,5
3,8
107
10,7

-1,7

0,31

-0,527

2,89

-4,7

-1,69

7,943

22,09

-3,7

-1,19

4,403

13,69

-2,7

-0,89

46,9
4,69

2,403
7,29
58,67
106,1
6,518889 11,78889

b1=
b0=

0,552969
-1,22677

For 50 26,42168

If we want to calculate the interval:

2 Queuing theory
A simple model for a computer system. An analyst wants to evaluate the performance
of a computer system. In order to make these evaluations, the analyst assumes that the
system is composed by a single processor unit and an I/O unit. The system is intended
to run simultaneously a number N of applications, each of them requiring a large
number of I/O requests. The analyst assumes that during a large period of time the N
applications are running without finishing. The time required to satisfy an I/O request is
exponentially distributed with an average of 100 ms. The time between two consecutive
I/O requests in any of the applications is exponentially distributed with an average of 10
ms. All these times have been measured running a single application on the computer
(i.e., with N=1)
The operating system can be configured in two different modes of operation accordingly
to a predefined CPU burst.
First mode of operation (infinite or very large CPU burst) once an application has
finished its I/O request, it enters into a processor queue waiting for its turn to be
processed. When the application reassumes its execution, the processor attends it until a
new I/O request happens; then the task goes to the I/O unit and the next application in
the queue is then attended by the processor.
Second mode of operation (very small CPU burst). The processor executes a CPU
burst (quantum) with a very short time if compared with the time between I/O requests

of the applications and the time taken for the change of context can be neglected. All
applications in the processor pool are attended following a multitasking operation. The
application is given a small CPU quantum (burst), then left, the next application in the
processor receives a CPU quantum and so on. If during a CPU quantum an I/O request
is found in the application code, then the application goes out of the processor pool and
enters in the I/O unit waiting for its I/O request to be completed.
In both modes of operation the applications that are in I/O state can be considered
attended in parallel by the I/O unit. Perform an analysis for N=4 applications.
For the 1st mode of operation:
a) [0,75 points] State a queuing model for the number of applications in the
processor, depict the transitions diagram, and calculate the probability of
finding no applications waiting for I/O. Will the queuing system be in steady
state?
b) [0,5 points] Evaluate the average number of applications that are waiting in the
I/O system for its I/O to be completed.
c) [0,5 point] Evaluate the average number of I/O requests per unit of time that the
I/O system must satisfy.
d) [0,75 points] Evaluate the average time that a task is either in I/O state or
waiting to be attended by the processor (sleep).
For the 2nd mode of operation:
e) [0,5 points] Using the general equilibrium equation, depict the transitions
diagram of the queuing model for the number of applications in the processor
and calculate the probability of finding all the applications in I/O state. Which of
the two modes of operation is more efficient (i.e. makes the applications to be
processed in less time)?
f) [0,5 points] Repeat e) if the time required for the change of context is not
negligible and it is 1/10 of the CPU burst. (time for processing the application
context not included in the CPU burst granted to the application)

3 DOE
We want to determine the effect of machining factors on ceramic strength, our response
variables is the ceramic strength.
We have 3 factors and for each factors different values.
Factor 1, the table speed is going from .025 m/s to .125 m/s, a real value.
Factor 2, the down feed rate is going from .05 mm to .125 mm, a real value.
Factor 3, the direction have two levels, longitudinal and transverse.
Define a DOE to determine what is the best scenario regarding our response variable.
How do you deal with the randomness of the experiment? What are you going to apply
to determine the best scenario? Justify your answers.
In that case we need to define a design that constrains the amount of experiments we ca
perform, since Factor 1 and Factor 2 are real values.
We propose to define a 2k factorial design with the next levels for the 3 factors we have.
Factor

Positive

Negative

.025 m/s

.125 m/s

.05 mm

.125 mm

longitudinal

transverse

With this the table we have is composed by 23 = 8 experiments as is shown in the next
table.
Experiment

Factor 1

Factor 2

Factor 3

Answer

Since the answer depends on an experiment that deals with random, it is needed to
replicate the scenario. In this case we are in a FINITE scenario, and we want to analyze
the loading process, hence INDEPENDENT REPETITIONS will be the best technique
to deal with randomness.

Loading period
needed
Loading period
unneeded

Finite
Independent repetitions
Independent repetitions erasing
the loading period/ Batch
means

No finite
Independent
repetitions
Batch means

To determine the number of replications needed in each experiment (row) it is needed to

calculate the half range for each experiment, and the desired half range. We can apply
the next expression to determine if the number of replications is enough.

n* = n(

h 2
)
h*

where:
n = initial number of replications.
n* = total replications needed.
h = half-range of the confidence interval for the initial number of replications.
h* = half-range of the confidence interval for all the replications (the desired halfrange).
Once we have the data correctly taken for each scenario we can go further and apply
Yates algorithm to determine eh interaction and the effects.
We:
1. Add the answer in the column i in the standard form of the matrix of the
experimental design.
2. Add an auxiliary column as factors exists.
3. Add a new column dividing the first value of the last auxiliary column by the
number of experimental conditions E, and the others by the half of E.
In the last column the first value is the mean of the answers, the last values are the
effects.
The correspondence between the values and effects is done through localize the +
values in the corresponding rows of the matrix. A value with a single + in the B column
is representing the principal effect of B. A row with two + on A and C corresponds to
the interaction of AC, etc.

Resp.

(1)

(2)

(3)

Efectes
/8

Mitjana

/4

/4

/4

AB

/4

/4

AC

/4

BC

/4

ABC

X+Y

Y
Y-X

Once we have some best candidates we can apply an ANOVA test to assure that our
best alternative is different from others, and makes sense to be applied in the industry.