Chapter 3 Solutions: For More Practice
Chapter 3 Solutions: For More Practice
3.8 You should be quite suspicious of both claims. A simple examination yields
6=2+4
12 = 4 + 8
18 = 2 + 16
24 = 8 + 16
30 = 2 + 4 + 8 + 16 (so we know Harry is wrong)
36 = 4 +
1
Chapter 4 Solutions: For More Practice
Chapter 4 Solutions: For More Practice
4.4 We wish to maximize the rate of processing while minimizing the total cost
required to do so. Therefore we are most interested in the cost per unit throughput.
At first gl
Chapter 5 Solutions: For More Practice
Chapter 5 Solutions: For More Practice
5.4 Fetching, reading registers, and writing the destination register takes a total of
300ps for both floating point add/subtract and multiply/divide. Thus, floating
point add/s
1
Chapter 6 Solutions: For More Practice
Chapter 6 Solutions: For More Practice
6.5 Obviously either the load or the addi must occupy the branch delay slot. We
cant just put the addi into the slot because the branch instruction needs to compare $3 with re
Chapter 8 Solutions: For More Practice
Chapter 8 Solutions: For More Practice
8.25 No solution provided.
8.35 We can't saturate the memory. At most five disks can transfer at a time be-
cause we have two I/O buses and the I/O bus is at 100 MB/sec and the
Chapter 7 Solutions: For More Practice
Chapter 7 Solutions: For More Practice
7.67.8 The key features of solutions to these problems:
I
Low temporal locality for code means no loops and no reuse of instructions.
I
High temporal locality for code means tig