{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw7_2011 - Copy (2)

# hw7_2011 - Copy (2) - minimal schedule time b Find the...

This preview shows pages 1–2. Sign up to view the full content.

ECE 153a/253 Homework 7 Reading: Papers on Website Problems: 1. Using an ILP package, optimize the following problem: x3 = x1*c1+x2*c2; x4 = c3*x3-c4; x5 = x1*c4+x3*c5-x4; out1 = x5*x3; out2 = x3-c6*x1; The {+,-} operations take 1 cycle on an ALU, and you are given 1 ALU. You have 2 available pipelined multipliers (which we'll call MP1 and MP2), but only 1 can start at a time. MP1 has a pipeline depth of 2 cycles and an energy cost of 10. MP2 has a pipeline depth of 3 cycles and an energy cost of 7. a) Find the minimum schedule time for this problem and the minimal energy cost associated with this

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: minimal schedule time. b) Find the minimal total cost such that: total cost = 3*latency + energy cost 2. Given the synchronous data flow system pictured below: a) Find x such that this system is consistent. b) Find a scheduling for this system. Specify how many buffers this schedule needs and where they should be placed. c) Find a scheduling for this system that requires the minimum number of buffers to maintain consistency. Specify how many buffers this schedule needs and where they should be placed....
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

hw7_2011 - Copy (2) - minimal schedule time b Find the...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online