### Errata for ReasoningAboutParallelArchitectures (RAPA)

#### Site map.

I am very grateful to Dean Liberty for identifying many of the errors listed below. -WWC

```p. 41, line -5.

Replace:  (P1,L2,R,0,A,S2) <crw (P1,L1,W,1,A,S2)

With:     (P2,L1,R,0,A,S2) <crw (P1,L1,W,1,A,S2)

Noted August 13, 2009, by Derek Williams, IBM Austin.

p. 120, line 2.

Replace: A2 = A(PO) * A(WA)

With:    A2 = A * A(PO) * A(WA)

p. 138, lines 7-10.

Replace: S1   S2   S3
A    A    A
B    B    B
C    C    B

With:    S1   S2   S3
A    A    A
B    B    B
C    C    C

p. 155, line 5.

Replace: A = 2

With:    A = 1

p. 182, line 5.

Replace: two pairs of paths

With:    two paths

p. 222, Variations 3 and 4.

In any machine that obeys CMP, X[i] will be either 0 or i, and
so it can never happen that X[i] > X[j] > 0 for i < j.  Thus,
neither variation is valid.

-- wwc, 1992.

p. 223, lines 5-6.

Replace:  Condition 1 must be modified to allow result values
to occur over the range from -1 to k.

With:  Condition 1 must be modified as follows:

X[i] is odd and -1 <= X[i] <= 2*k - 1, and
Y[i] is even and 0 <= Y[i] <= 2*k.

Noted July 1, 2005, by John Pape, Freescale Semiconductor.

p. 223, line -2.

Replace:  X[i+] = a < Y[j] = b < Y[j+] = c < X[i] = d

With:     X[i+] = a < Y[j] = b and Y[j+] = c < X[i] = d

There is no use made of the condition b < c in the argument
used to detect a failure of a machine to obey A(CMP,RO,WO), and
therefore it can be eliminated.

This is a very significant change.  It makes the test far
more sensitive.

Noted September 10, 2007, by Jens Ramsey, Freescale
Semiconductor, and by myself at about the same time.

p. 224, line -9.

Replace:  Theorem A7

With:     Theorem A5

p. 226, line 13.

Replace:  Condition 3.  V[i] >= X[j] or Y[j] >= U[i] for 1 <= i,j <= k.

With:     Condition 3.  V[i]   >= X[j] or Y[j]   >= U[i] for 1 <= i,j <= k and/or
U[i+1] >= Y[j] or X[j+1] >= V[i] for 1 <= i,j, < k.

Noted September 10, 2007, by Jens Ramsey, Freescale Semiconductor.

p. 227, line 14.

Replace:  Condition 4. V[i] >= j or Y[j] >= i for 0 <= i,j <= k.

With:     Condition 4. V[i] >= j or Y[j] >= i for 1 <= i,j <= k.

Noted June 27, 2005, by John Pape, Freescale Semiconductor.

```
Last updated September 12, 2009.