chapter04 exercises

8
BK TP.HCM 2010 dce COMPUTER ARCHITECTURE COMPUTER ARCHITECTURE CE2010 CE2010 Faculty of Computer Science and Engineering Department of Computer Engineering Nam Ho [email protected]

Upload: do-cong-thanh

Post on 28-Apr-2015

66 views

Category:

Documents


7 download

TRANSCRIPT

Page 1: Chapter04 Exercises

BKTP.HCM

2010dce

COMPUTER ARCHITECTURECOMPUTER ARCHITECTURECE2010CE2010

Faculty of Computer Science and EngineeringDepartment of Computer Engineering

Nam Ho [email protected]

Page 2: Chapter04 Exercises

2010dce

2Computer Architecture – Chapter 4

Chapter 4Chapter 4THE PROCESSORTHE PROCESSOR

Page 3: Chapter04 Exercises

2010dce

3Computer Architecture – Chapter 4

Exercise 1• Assuming we have a hardware with single clock implementation and latencies of blocks

showed on the table below.• What is the critical path (longest-latency) for a MIPS AND instruction ?• What is the clock cycle time ?

100psControl350psD-Mem200psRegs120psALU30psMux100psAdd400psI-Mem

Page 4: Chapter04 Exercises

2010dce

4Computer Architecture – Chapter 4

Exercise 1• The the critical path (longest-latency) for a

MIPS AND instruction– I-Mem ->Regs -> Mux -> ALU -> Mux

• The critical path for LOAD instruction– I-Mem ->Regs -> Mux -> ALU -> D-Mem->Mux– CC = 400 + 200 + 30 + 120 + 350 + 30 = 1130ps

Page 5: Chapter04 Exercises

2010dce

5Computer Architecture – Chapter 4

Exercise 2• How long should the control unit generate the

MemWrite signal ?– Maximum time is CC – I-Mem = 1130ps – 400ps

• How about RegWrite?

100psControl

350psD-Mem

200psRegs

120psALU

30psMux

100psAdd

400psI-Mem

Page 6: Chapter04 Exercises

2010dce

6Computer Architecture – Chapter 4

Exercise 3• Assume that the instructions executed by a

processors are broken down as follows.

• Assuming there are no stalls or hazards, calculate speedup with pipelined organization and multi-cycle single clock.– (0.15 x 5 + (0.5 + 0.1) x 4 + 0.25 x 3) * IC * CC– 1 * IC * CC

10%15%25%50%swlwBeqALU

Page 7: Chapter04 Exercises

2010dce

7Computer Architecture – Chapter 4

Exercise 4• Indicate dependences and their type for the following

sequence of instructionI1: lw $1,40($6)I2: add $6,$2,$2I3: sw $6,50($1)

• Assume there is no forwarding in this pipelined processor. Indicate hazards and add nop instruction to eliminate them

• Assume there is full forwarding. Indicate hazards and add nop instruction to eliminate them

Page 8: Chapter04 Exercises

2010dce

8Computer Architecture – Chapter 4

Exercise 4I1: lw $1,40($6)I2: add $6,$2,$2I3: sw $6,50($1)

lw $1,40($6)add $6,$2,$2nopsw $6,50($1)

lw $1,40($6)add $6,$2,$2nopnopsw $6,50($1)