Question

(Pipelining) Given 3 different instruction types, A, B and C. Each type-A, B, and C instruction takes 40ns, 25ns and 50ns to complete, respectively. An assembly program is written with 30 type-A, 40 type-B and 20 type-C instructions.

(a). Assume a single-issue not pipelined processor, how much time (in nano-seconds) is required to complete the execution of this program? (10pts)

(b). Now let us pipeline these instructions based on a cycle time of 10ns. To pipeline these instructions equally and ideally using this cycle time (all instructions take the same number of pipeline stages to complete).

(1) what is the latency of each instruction (in cycles)? (5pts).

(2) How much time (in nano-seconds) is required for this pipelined machine to complete execution of the program? (Assume the program does not encounter whatsoever pipeline hazards during the execution). (5pts).

(3) What is the speedup over the processor in 1.1? (10pts).

this is everything that were given by the teacher

Answer 1

answer to above question