This preview shows page 1. Sign up to view the full content.
Unformatted text preview: rtv ALU MD dst dst dst Decode dest. reg NPC Problem 2: Execution should be ineFcient in the problem above. ( a ) Add exactly the bypass connections needed so that the program above executes as fast as possible. • Don’t forget that branch uses ID-stage comparison units. • Don’t forget the store. ( b ) Show a pipeline execution diagram of the code on the improved implementation. ( c ) ±or each bypass path that you’ve added show the cycles in which it will be used by writing the cycle number near the bypass path. If a bypass path goes to several places (for example, both ALU muxen) put the cycle number at the place(s) that use the signal. ( d ) Re-compute the CPI and the rate at which memory is copied....
View Full Document
This note was uploaded on 08/01/2009 for the course EE 4720 taught by Professor Staff during the Spring '08 term at LSU.
- Spring '08