Change 1.6.5 to read: If the number of instructions executed in a certain progra

Question

Change 1.6.5 to read: If the number of instructions executed in a certain program is divided equally among the classes of instructions found in Table 1.6.3a except for class A, which occurs twice as often as each of the others, how much faster is one processor to the other. Specifiy which processor is faster
Conpiler A Compller B t Instractiens Exeeution tise 1 s 0.8s f lestructions .20E+09 120t+0 Execution time 1.4 s 0.7 s b. 16.1 15 1.4> For the same program, two different compilers are used. The toble above shows the execation time of the two different compiled programs. Find the average CPI for each program given that the processor has a clock cyule ime of 1 nS. 16.2 15l Assume the average CPls found in 16.1, but that the compiled programs rur on two difference processors If the execution times on the two processors are the sarne, how much faster is the clock of prucessor runniug compiler A's cace versis the clock of the processr running compiler B's code? 6.3 15: A new compiler s developed that uses only 600 million instruc- tions and has an average CPI of 1.1.What is the speed-up of using this neve compiler versus using Compiler A or B on the original processor of 1.6.12 Consider two different implementations, Pl and F2, of the same instruction set. There are five classes of instructions (A, B, C, D, and E) in the instruction set. P has a clock rate of 4 GHz, and P2 has a clock rate of 6 GHz. The average number of cycles for each instruction class for Pl and P2 are listed in the following tabl: Closs CPI on P2 Class cPI on P1 CPIon P2 b. 1.6.4 151 Assume that peak performance is deined as the fastest rate that a computer can execute any instruction sequence. Wha: are the peak performances of PI and P2 expressed in instructions per second? 1.6.5 [511.4> If the number of instructions executed in a certain program is divided equally among the classes of ins ructions in Prolem 2.364 except for dass A, which occurs twice as often as each o the cthers, how much faster is P2 than P1? 1.6.6 151 At what frequency does P2 have the same performance as Pl for the instruction mix given in 1.6.5

Explanation / Answer

1.6.1 clock time 1ns

p1 #instructions execution time

1.00E+09 1s   

compiler A:1s/1ns =109 cycles

CPI=109 cycles/109 instructions

=1.0

P2:1.00E+09 0.8s

0.8/1ns =0.8x109 cycles

CPI=0.8x109 cycles/109 instructions

=0.8

Average CPI=1+0.8=1.8/2=0.9

2)compiler B

#instructions #execution time

1.20E+0.9 1.4s

1.4/1ns=1.4x109 cycles

CPI= 1.4x109 cycles/1.2x109 instructions= 1.16

1.20E+09 0.7s

0.7/1ns=0.7x109 cycles

CPI= 0.7x109 cycles/1.2x109 instructions =0.58

Average CPI=0.8716

1.6.2)PerformanceA /Performance B =0.8716/0.9 =0.96

   Compilee A is 0.96 times faster than compiler B

1.6.3)New compiler vs compiler A=0.9/1.1 =0.818

New compiler is 0.8 times faster.

New compiler vs compiler B=0.8716/1.1 =0.792

New compiler is 0.79 times faster.

1.6.4)Execution time =no.of instructions executed x average CPI x CPU clock cycle

  

   

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.