Parallel Computer Architecture: a Hardware/Software Approach David E. Culler, University of California, Berkeley;  Jaswinder Pal Singh, Princeton University;  with Anoop Gupta, Stanford University  Morgan Kaufmann Publishers

## Corrections in the second Printing

• page 60: Equation (1.4) n1/2 = T0B
• page 73, problem 1.9, replace last three sentences with
• Graph the average message rate as a function of m for various values of T = 100ns, 200 ns, 800ns, 1600ns.  What is the asymptote?
• page 73, problem 1.15 wording after first two sentances should be
• Assume that before transmitting a message the data must be copied into a buffer, the basic message time is as in Exercise 1.14, but the copy is performed at a cost of 5 cycles per 32-bit word on a 100-MHz machine.  Give an equation fo the expected user-level message time.  How does the cost of a copy compare with the typical fixed cost of entering the operating system?
• page 74, problem 1.16, delete "50% of"
• page 74, problme 1.17, delete ", leaving 50% headroom on the bus to make the calculation reasonable"
• page 104: line 15 comment - should be loop until convergence
• page 106: line 4 - cell_lock should be diff_lock
• page 107: figure 2.14.  b: flag = 1; should be all on one line
• page 114, figure 2.17: Missing final endif
• page 133: fig 3.4 RHS n/p should be n/sqrt(p)
• page 346: fix statement about lock complexity