Chapter 1: Q23E (page 2)
Question: B.23 [20] <§§B3, B.4, B.5> Repeat Exercise B.22, but for an unsigned divider rather than a multiplier.
Short Answer
Answer
The Verilog implementation for the specified unit:
Chapter 1: Q23E (page 2)
Question: B.23 [20] <§§B3, B.4, B.5> Repeat Exercise B.22, but for an unsigned divider rather than a multiplier.
Answer
The Verilog implementation for the specified unit:
All the tools & learning materials you need for study success - in one app.
Get started for freeConsider two different implementations of the same instruction set architecture. The instructions can be divided into four classes according to their CPI(class A, B, C, and D). P1 with a clock rate of 2.5 GHz and CPIs of 1,2,3, and 3, and P2 with a clock rate of 3 GHz and CPIs of 2,2,2, and 2.
Given a program with a dynamic instruction count of 1.0E6 instructions divided into classes as follows: 10% class A, 20% class B, 50% class C, and 20% class D, which is faster?
a)What is the global CPI for each implementation?
b) Find the clock cycles required in both cases.
Question: Compilers can have a profound impact on the performance of an application. Assume that for a program., compiler A results in a dynamic instruction count of 1.0E9 and has an execution time of 1.1 s, while compiler B results in a dynamic instruction count of 1.2E9 and an execution time of 1.5 s.
Find the average CPI for each program given that the processor has a clock cycle time of 1 ns.
Assume the compiled programs run on two different processors. If the execution times on the two processors are the same, how much faster is the clock of the processor running compiler A’s code versus the clock of the processor running compiler B’s code?
A new compiler is developed that uses only 6.0E8 instructions and has an average CPI of 1.1. What is the speedup of using this new compiler versus using compiler A or B on the original processor?
B.30 [15] <§B.6> This exercise is similar to Exercises B.28 and B.29, but this time calculate the relative speeds of a 64-bit adder using ripple carry only, ripple carry of 4-bit groups that use carry lookahead, ripple carry of 16-bit groups that use carry lookahead, and the carry-lookahead scheme from Exercise B.27.
B.27 [15] <§B.6> Write the equations for the carry-lookahead logic for a 64- bit adder using the new notation from Exercise B.26 and using 16-bit adders as building blocks. Include a drawing similar to Figure B.6.3 in your solution.
B.17 [5] <§§B.2, B.3> Show a truth table for a multiplexor (inputs A, B, and S; output C ), using don’t cares to simplify the table where possible .
What do you think about this solution?
We value your feedback to improve our textbook solutions.