MCA IGNOU

Related Topics

CS -12 Computer Architecture Dec-2003

Question Paper of CS -12 Computer Architecture Dec-2003 Q.I (a) Analyze the data dependence among the following statements in a given program fragment Load R1, M (100) /R1, { - M (100)/ Load R2, M (104) /!R2 { - M(104)/ Multi R1, R2

CS -12 Computer Architecture June -2001

h1>Question Paper of CS -12 Computer Architecture June -2001 Q.I (i) Consider a cache (M(1) and memory (M2) hierarchy with the following characteristics: M1,: 16 K words, 50 ns access time M2: 1 M words, 400 ns access time Assume 8 words cache blocks and a set size of 256 words with set associative mapping. (a) Show the mapping between M2 and M1,. (b) Calculate the effective memory access time with a cache hit ratio of h = 0.95. a) Number of Blocks per set 256 /8 =32 blocks

CS -12 Computer Architecture Dec-2004

Question Paper of CS -12 Computer Architecture Dec-2004 Q.I (a) What is mean by inclusion, coherence, and locality in a memory hierarchy? Explain through diagram and examples. Q.I (b) What is meant by superscalar processor? Explain the concept of pipelining in superscalar processors with diagram. : Q.I (c) Shnv the pipelined execution of successive instructions in two unierpipelined cases and explain each case. Q-l (d) Derive the speedup execution for S(m, 1) to compare the relative performance of a superscalar processor with that

CS-12 Computer Architecture June - 2002

Question Paper of CS-12 Computer Architecture June - 2002 Ql(i) Consider the execution of the following code segment. Use Bernstein's condition to detect the maximum parallelism embedded in this code. Justify the portion that can be executed is parallel and the remaining portion that must be executed sequentially. S1,:A = B + C S2,: C = D + E S3:F = G + E S4: C = A + F S5: M - G + G S6:A = L + C S7: A =

CS -12 Computer Architecture Jan -2001

Question Paper of CS -12 Computer Architecture Jan -2001 Q.I (i) The execution times (in seconds) of four programs on three computers are given below: Execution Time (in seconds) Program ComputerA ComputerB Computer C P1 1