When processor designers consider a possible improvement to the processor datapath, the decision usually depends on the cost/performance trade-off . In the following three problems, assume that we are starting with a datapath from Figure 4.2, where I-Mem, Add, Mux, ALU, Regs, D-Mem, and Control blocks have latencies of 400 ps, 100 ps, 30 ps, 120 ps, 200 ps, 350 ps, and 100 ps, respectively, and costs of 1000, 30, 10, 100, 200, 2000, and 500, respectively.

Figure 4.2

Consider the addition of a multiplier to the ALU. Th is addition will add 300 ps to the latency of the ALU and will add a cost of 600 to the ALU. Th e result will be 5% fewer instructions executed since we will no longer need to emulate the MUL instruction.

1. What is the clock cycle time with and without this improvement?

2. What is the speedup achieved by adding this improvement?

3. Compare the cost/performance ratio with and without this improvement.

Transcribed Image Text:

Branch Add Add х ALU operation Data MemWrite Register # Address ALU Registers PC Address Instruction IZero Register # Data Instruction memory Register # RegWrite х memory Data MemRead Control