Problem 1: What Out-Of-Order processor hardware structure can be used to enforce that instructions commit in order?

Ans: Reorder Buffer is used to enforce Out-of-order processor hardware structure to commit instruction in order. Problem2: Register renaming is able overcome which of the three data hazards? Ans: Register renaming is able to overcome WAR (Write After Read) and WAW (Write After Write) hazards. Problem 3: How many SRAM bits are needed to implement an 8KB two-way set associative cache with 64B block size? Assume that each line (entry) has a single valid bit and no dirty bits. There is one bit per set for true LRU. Assume that the address size of the machine is 32-bits and that the machine allows for byte addressing. Ans: Total no of cache blocks = 8KB/64B = 128. And No of sets = 128/2 = 64. Hence total bit required to implement Valid bit and true LRU is 64 + 128 =192 bits. As we can see 6 bit is required for selecting the set and another 6 bit for selecting the byte in the block making total of 12 bits, the rest of the 32 bits is managed for tags which is required for each block. Hence for tag total bit is required is 20 * 128 bits = 2560 bits And total bit to manage memory = 8 * 1024 * 8 = 65536 bits Making total of 68288 bits of SRAM Bits. Problem 4: Which of the following two processors will execute a program with the given instruction mix faster? Name Frequency CPI for ALU instructions CPI for branch instructions CPI for memory instructions Instruction Mix: 50% ALU Instructions 10% Branch Instructions 40% Memory Instructions Ans: For Processor A , One Clock Cycle = 1/1GHz = 1nano seconds Now the average time to execute one instruction on processor A is 0.5(1 * 1) + 0.1(2 * 1) + 0.4(1 * 1) = 0.5 + 0.2 + 0.4 = 1.1 nano seconds. Now for processor B, Processor A 1GHz 1 2 1 Processor B 2GHz 1.5 3 2

One clock Cycle = 1 / 2GHz = .5 nano seconds Now the average time to execute one instruction on processor B is, 0.5(.5 * 1.5) + 0.1 (.5 * 3) + 0.4 ( .5 * 2) = 0.925 nano seconds. As we see that the average time of Processor B < Average time of processor A hence we can say that the processor B is faster to execute a program than Processor A.