V

'NAME:
EOE585 EXA'M II
Open TextBook ONLY; G-alculators OK; No other material
Make reasonable assumptions .as ·appropriate; explicitly indicate all assumptions made
'Problem 1 :A .s plit I-cache and D-cache system operates in 1he write back mode. The instruction distribution
is asiollows: Loads: 15%, stores : '10%, others75%. The cach.e is one cycle access cache. There are
4 words per block. ihebus bandwidth between 1he cache and memory is 2 words/cycle and the memory
access1ime (read or write) is 3 cycles/access (word or block). The hit Tate for I-cache is95% whereasior1he
D-cache is 90%. ihe cache operates in1he write-allocate mode.
Determine1he overall CPI

,t

·7 ;X
vi15
\ ...
0 '7

---7 0 ;X 0 " ..5 )< ~ .::D "2.. )

s -"7 O · C{ y 0" 0 ')t
W )

1) 12.. T --

I · q 2.-5

. to

2-' 17 5
L(!) d
C{ -1\~ ~

·qS x 0-15 Y t ! q25

- 0 ,

095x 0-1 (I 3 -/75)

+-

o· 30

~\
 (Blank Sheet)
CQ.bC?.. (II) J;:6 ~ U L h'Or> HI '

'> 0'05>< O'7.sr!+~+I)

- O· 225

/Ou.. ~ ". 0'05)< 0'/5 -3+:1+ 1 +2)12.T)

'6'Q..
0'0 O· 0 (3 L~ ~:!) ,

05 o·
C ?, 175)
O· 0 O~
/
~ 0, 2..2.S + 0 0 S ~ o 0 0

(. 75 b
-

 I
Iii
j

III

iii

Ptobfell1 2: The main memory of a computer has a capacity at three pages The incoming stream Is ptovided in the following

figure . Show the manner in which the pages are used lor the following algorithms OPT, LIFO, and MRU Explicitly show all the hits.

Use FIFO in case of a tie .

Ihcoming I 3 I 1 I 3 2 5 2 4 :3 :2 11 I 4 12 11 I 5 4- I :3

stream

OPT (Orti~utn) .. , N~ ~ \...., \.~ ~ ~

..:s ..:3 .3 ...3 I I I I I I I I Y .-.. 1

H ·
:ili
~

H
2-

LIFO (Laslln First out

I ~
..3 1 ~~ .3
-
I
4 ~ !2-
H ~

II
I,

/'
No j "'I ~ - ~
 :Problem .:3(a): The cycie access ·time for -the fir.st hit in a 16kB :pseudo-associative cache is 1 cycle and
.additional .access timeforthe second 'entry is3cycles. Two-way set associative technique is used 'for
first access and Direct Mapped ior .second access. Upon 'the hit into the second location, the contents are
swapped into ·the primary location and it takes 2 cycles todo -the-transfer. The miss penalty to access main
memory is 30 cycles . Determine -the CPI using the data from 'Figure C oB, Page C23 of -the text. Explicitly
derive/statetheiormula being used.
~-~{6~K-::G::------;;iii'

11tJ t
.,
C"P -­ ~I ~O -I­

(
~l ~S (1CAAJ
1 -
­
0 J
- r~s ~
I
H,J-- ~~c... 0 e. S 0 r\ I ch~Q.,
~O1

\~
/).! ~~ ~\ t
"
Q., ><5
~,t V
•
2 ~1 - '100)

IS
,~

f +­
C'PI ~
+
,X

- -. - - - ­
(1' .I: -
--.

- - .­
0
--- - ~
- =
~ ~
:Pro.blem :3{b): For.:an I/O system, the utilization is 80% and -the _service time is 4ms _
(i) Determine the arrival rate
(ii) Determinethe average number of packets in the system
(iii) Determine the mean time spent in the system

<) -- o·
- o

o· % -­ ~
­
~ M~

A. -::.. o·
- MS

tA t .. 0 s/ t.S ~ ~ -

0.& -- ~etv ~

-~
-~
- )(1 0 -- ,~ ~s
0,2­

!t:~ ~ y ~'-l ~
 ,'"•

__ 20 MS
j

",
 :Pro:blem4: A disk has 10 surfaces , 2,500 -tracks/surface , and 32 sectors/track . It rotates at 3,600 rpm.
Each sector supports 800 Byte "data and has a guard band of 200 Bytes between -the data containihg regions.
The ave. seek time is3 ms. The disk I/O data :size is 4 Kbytes and .p arts of-any two disk blocks cannot be
co-Iocate-d on the same data sector. The disk processing latency is 2 ns/bit.
(a) Determine how many disk 1I0datatr.ansactions can be stored on one track .
(b) Determineihe total latency of the:disk -system for one I/O transaction .
(c) Determine the overall disk performance in;# of disk I/O transactions/sec for random disk transactions
per surface
(d) Determine the overall bandwidth of the disk system (Bytes/sec)
(e) What is the latency for three consecutive I/O transactions ifthey are located in sequential sectors.

"'~ 3 2.. S c.. h:>..l. ~

sc-cJo'Y' lev "51:>0 bkA ~ cl"Je­

~ , ~c.J 25600
b
"( 0 w O()~ ~f 0 J-.-ru~ ~C_J1 u r")
::: 4- \~
- - 40QbtJk,
No sec.b y ; , No.~QJ.~,.

-- 40~b

800

Nu ~

Nt;) w cTLQ). <:?­ •

<hock.

. =-It .r/o
-- -- 5
6
r....... -­
 ct.,.,
-
-

- , 12. x 60
G 0

2 · 6 7 N'\: :'/
- 2- )< 4 >< I0 2.1- x
0 - 0655 M~ ?

.. . --I~~.J rO~c.t'\ 1 )Y C!rTl =

~+- ·3 + 23 + 0/5
::- 14-·0G5~ M~

.' , -it d JyOW.Q.cJ{~i6e.Gt 2" dOC

/'
09 ~

25 \"J ~ \Q.Q... cl&/<.. Sjstofs. Jocc...

~ 7 f. 0 ~ 5" X 4 x, 02..t
:=. M 6J ~C!.A / .s e.c.
,., 03tJ cfo Y ~ Jof 10 S iCACC!..
=­ 2 .q I M b1/-aA /s~c..

-3 c.tJ

...

- I
Problem '5(a): The'repair timeior a system is 2 hours , The FITs are 50,000 , Determine the Down Time -for
the system.

F IT S - '0 9
<.500 0

TT
MTTF - 0,0

- M,Tf=:
T
--
..... 2..000b

v t \, I I
 -Pr.oblem :5(b) A computer system contains an 110 controller controlling three 1/0 units.l'he .availability for
·each of the sub-systems is indicated in1he diagram.
(i) Determ ine the probability when no users are being supported by the system .
(ii) Determine theav.ailability for at least 200 users.
Bus 0.97

~
I \ 1
J
~
cache l'/0 control
0.98 0.92 0.93 0.9
I

I I 1 I
CPU 110 unit rIO unit 1/0 unit
0.99 0.92 0.92
J 0.92

100 users 100 users 100 users

. . (P<.AO be-b, "1 -1k o t no

~7 ~ I o \
\0 0 \...V) (!.J..so a"f <:t ~ "f po 'f hoi
'--­
l

( D .q2
3
+
7x 0
--- qt') o
D . ~ 2.)( 0 OCl; x 3
2­
+ tn)l~.o~ ~
-
c:;r)
. .

I
i
 o· q~ . 0 o () c

X..3 -+- O''l2)J

o 71 Q

/
I

\ 0 . - - - - - -- _ _ _ _