Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Question: [5] Assume for a given processor the CPI of arithmetic instructions is 1, the CPI of load/store instructions is 10, and the CPI of branch instructions is 3.

Assume a program has the following instruction breakdowns: 500 million arithmetic instructions, 300 million load/store instructions, 100 million branch instructions.

2.46.1 [5] <§2.19> Suppose that new, more powerful arithmetic instructions are added to the instruction set. On average, through the use of these more powerful arithmetic instructions, we can reduce the number of arithmetic instructions needed to execute a program by 25%, and the cost of increasing the clock cycle time by only 10%. Is this a good design choice? Why?

2.46.2 [5] <§2.19> Suppose that we find a way to double the performance of arithmetic instructions. What is the overall speedup of our machine? What if we find a way to improve the performance of arithmetic instructions by 10 times?

Short Answer

Expert verified

2.46.1

Increasing the execution time can’t be a good choice.

2.46.2

By assuming, if the performance of arithmetic instructions is doubled then the overall speedup of that machine will be 2.069.

By assuming, if the performance of arithmetic instructions is increased by 10 times then the speedup will be 1.134.

Step by step solution

01

Define the concept.

2.46.1

2.46.2

The CPI of the arithmetic instructions is 1.

By assuming, the performance of arithmetic instructions is doubled.

So,1×0.5= 0.5

02

Determine the calculation.

2.46.1

Given,

The CPI of the arithmetic instructions is 1.

The CPI of the load or store instructions is 10.

The CPI of the branch instructions is 13.

The breakdown of the arithmetic instructions is 500 million.

The breakdown of the load or store instructions is 300 million.

The breakdown of the branch instructions is 100 million.

The sum of all these breakdown = (500+300+100) = 900 million.

Let’s assume, to execute a program the number of arithmetic instructions can be reduced by 25%

The sum of these breakdown = (375+300+100) = 775 million.

Hence the current execution time > the previous execution time.

Increasing the execution time can’t be a good choice.

2.46.2

By assuming, the performance of arithmetic instructions is doubled.

At the start, the CPI is 4.22.

By assuming, the performance of arithmetic instructions is increased by 10 times.

Overall speedup=1.134

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Question: If the current value of the PC is 0x00000600, can you use a single jump instruction to get to the PC address as shown in Exercise 2.39?

Question: For each function call, show the contents of the stack after the function call is made. Assume the stack pointer is originally at address 0x7ff ff ff c, and follow the register conventions as specified in Figure 2.11.

Assume that for a given program 70% of the executed instructions are arithmetic, 10% are load/store, and 20% are branch.

2.47.1 [5] <§2.19> Given this instruction mix and the assumption that an

arithmetic instruction requires 2 cycles, a load/store instruction takes 6 cycles, and a branch instruction takes 3 cycles, find the average CPI.

2.47.2 [5] <§2.19> For a 25% improvement in performance, how many cycles, on average, may an arithmetic instruction take if load/store and branch instructions are not improved at all?

2.47.3 [5] <§2.19> For a 50% improvement in performance, how many cycles, on average, may an arithmetic instruction take if load/store and branch instructions are not improved at all?

Question:2.18 Assume that we would like to expand the MIPS register file to 128 registers and expand the instruction set to contain four times as many instructions.

2.18.1 [5] How this would this affect the size of each of the bit fields in the R-type instructions?

2.18.2 [5] How this would this affect the size of each of the bit fields in the I-type instructions?

2.18.3 [5] How could each of the two proposed changes decrease the size of an MIPS assembly program? On the other hand, how could the proposed change increase the size of an MIPS assembly program?

Question: If the current value of the PC is 0x00000000, can you use a single jump instruction to get to the PC address as shown in Exercise 2.39?

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free