Scribd
Upload
210 views

Parallel Programming (Wilkinson)

This document contains errata and corrections for the book "Parallel Programming 2nd edition". It lists several mistakes found in the book and provides the correct information to address those mistakes. The mistakes involve incorrect page references, mathematical equations, figure labels, and code syntax. Making these corrections ensures the technical information in the book is accurate.

Uploaded by

Mârcô Ẫntôniô
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
210 views

Parallel Programming (Wilkinson)

This document contains errata and corrections for the book "Parallel Programming 2nd edition". It lists several mistakes found in the book and provides the correct information to address those mistakes. The mistakes involve incorrect page references, mathematical equations, figure labels, and code syntax. Making these corrections ensures the technical information in the book is accurate.

Uploaded by

Mârcô Ẫntôniô
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 485

Parallel Programming 2nd edition

ERRATA
As of November 1st 2007
Page 77 Problem 2.4: “... as given in Figures 2.14 and 2.16” should read
“... as given in Figure 2.12”

Page 118: Sequential Algorithm: “A more effective way is to divide the


number by m/a ... ” should be “A more effective way is to divide the num-
ber by a/m .. ” i.e. m/a should be a/m (several places).

Page 147 - 148: Single Instance of Problem


The statement “ ... and two communications, one communication from the
left and one communication from the right.” does not take into account that
both communications will overlap and take place at the same time
(although for different instances of the problem. Hence the equation:

tcomm = 2(tstartup + tdata)


should read
tcomm = tstartup + tdata

This correction then affects the subsequent equations on page 147 and page
148.

We are very grateful to Professor Fernando G. Tinetti, Universidad Nacio-


nal de La Plata and Instituto Tecnológico de Buenos Aires for pointing out
this mistake.

Page 222: The line:

} else vertex_queue == FALSE;

should read:
} else vertex_queue = FALSE;

Page 350: The line:

recv(&b,Pi-1,j); /* receive from right */

1
should read:

recv(&b,Pi-1,j); /* receive from above */

Page 355:
n–1
(n + 3)(n + 2)
∑ ( n – j + 2 ) = ----------------------------------
2
t comp = 2 – 3 = O(n )
2
j=1
should read:
n–1

∑ (n – j + 2) = (n – 1)(n + 4) = O(n )
2
t comp = 2
j=1

We are very grateful to Gaoyuan Huang for pointing out this mistake.

Page 403: Figure 12.36 should look like:

2
Mask
1

1 2 3 4 5 6 7 Figure 12.36 Image for Problem 12-3.

You might also like