CS -12 Computer Architecture June-2004
Question Paper of CS -12 Computer Architecture June-2004
Q.I (a) Analyze the data depedendes among the following statements in a given program fragment:
S1,: Load R,, M(242) / R, r - M(242) /
S2: Load R,, M(240) / R, r- M(240) /
S3;MULTY R3,R1,R2/R3?(R1)x (R2) /
S4: ADDR…R1, R3/R1-(R1)x (R3) /
Ss: STORE M(240), R/M(248)?(R2) /
Draw a dependency graph to show all the three types of dependencies and explain them.
Q.I (b) Consider the main memory of a computer which has 128 blocks, where the size of each block is 16 words. The cache memory has 16-block-frames.
Sketch the fully associative mapping scheme. Also design the address format showing a tag field, block number and word number.
Q.I © What is a hot spot problem? Why does it occur?
Q.I (d) What is the cache coherence problem? Descrive two protocol approaches, with the help of a suitable diagram.
Q.I (e) Explain the applicability and restrictions involved in using Amdahl’s law to estimate the speed-up performance of n processor systems compared with that of a single processor.
Q-I (f) Show the pipelined execution of successive instructions in two underpipclined cases, and explain each case.

