15.01.2013 Views

U. Glaeser

U. Glaeser

U. Glaeser

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

The traditional load independent mean value analysis program (LIMVA) is based on assumption that<br />

the service times of all servers are constant. The goal of MVA models is to compute system response<br />

times, utilizations, and throughputs. Following is the traditional LIMVA model:<br />

for n = 1 to N do<br />

end_for<br />

For perfectly balanced systems where all demands are equal (D = V1S1 = V2S2 = … = VK SK), this algorithm<br />

yields equal distribution of jobs in service centers<br />

This is a consequence of equal residence times:<br />

Qk( 0)<br />

= 0, k = 1,…,K<br />

Rk( n)<br />

= Sk[ 1 + Qk( n – 1)<br />

], k = 1,…,K<br />

K<br />

∑<br />

R( n)<br />

= VkR k( n)<br />

k=1<br />

X( n)<br />

= n/R( n)<br />

Xk( n)<br />

= Vk X( n),<br />

k = 1,…,K<br />

Uk( n)<br />

= Sk Xk( n)<br />

= Dk X( n),<br />

k = 1,…,K<br />

Qk( n)<br />

= Vk X( n)Rk(<br />

n),<br />

k = 1,…,K<br />

Qk( n)<br />

= n/K, k = 1,…,K<br />

Vk Rk( n)<br />

= Dk[ 1 + Qk ( n – 1)<br />

] = D[ 1 + ( n – 1)/K],<br />

k = 1,…,K<br />

and their use for computing Q k(n) = V k X(n)R k(n). Furthermore, this yields linear response times, and<br />

other relations:<br />

R( n)<br />

= KVkRk( n)<br />

= ( n – 1 + K)D<br />

Rk( n)<br />

= ( n – 1 + K)Sk/K,<br />

k = 1,…,K<br />

X( n)<br />

= n/ ( n – 1 + K)D<br />

Xk( n)<br />

= n/ ( n – 1 + K)Sk,<br />

k = 1,…,K<br />

Uk( n)<br />

= n/ ( n – 1 + K),<br />

k = 1,…,K<br />

Of course, in a general case we have different demands, and the response time is no longer linear.<br />

Unfortunately, the nature of the LIMVA model is essentially quasi-linear. Even for different demands the<br />

response time curves remain similar to straight lines.<br />

Limitations of the LIMVA model are exemplified in Fig. 8.11. In this case the processor service time<br />

obtained from measurements is S p = 825 µs, the number of processor visits per job is V p = 7000, yielding<br />

processor demand D p = 5.775 s. The number of disks is 14 and the number of disk visits per job is V d =<br />

7000/14 = 500. The available resources include the central processor and 14 equally loaded disk units. A<br />

spectrum of LIMVA models can be obtained for disk service times varying in the range 12 ms ≤ S d ≤ 24 ms,<br />

© 2002 by CRC Press LLC

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

Saved successfully!

Ooh no, something went wrong!