Question: (b) Assuming that: Floating point operations (adds and multiplies) take three cycles Loads take two cycles Integer operations (adds, compares, and jumps) all take 1

 (b) Assuming that: Floating point operations (adds and multiplies) take three

(b) Assuming that:

Floating point operations (adds and multiplies) take three cycles Loads take two cycles Integer operations (adds, compares, and jumps) all take 1 cycle All functinoal units are fully pipelined (issue latency = 1) and there are no functional unit bottlenecks in the processor (e.g. there are sufficient functional units to run all independent operations in paralllel)

What is the critical path through this code, and how long is it?

float aN], bN] int i for (i So, %eax mov! L1

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!