1. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Principles of Parallel Programming First Edition by Calvin Lin Lawrence Snyder Chapter 4: First Steps Toward Parallel Programming

2. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-2 Table 4.1 Semantics of full/empty variables.

3. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-3 Figure 4.1 The Count 3s computation (Try 3) written in the Peril-L notation.

4. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-4 Figure 4.2 Fixed Parallelism solution to Count 3s (t=4).

5. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-5 Figure 4.3 Scalable Parallelism solution to Count 3s. Notice that the array segment has been localized.

6. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-6 Table 4.2 Helper functions.

7. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-7 Figure 4.4 Odd/Even Interchange to alphabetize a list L of records on field x.

8. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-8 Figure 4.5 Fixed 26-way parallel solution to alphabetizing. The function letRank(x) returns the 0- origin rank of the Latin letter x.

9. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-9 Figure 4.6

10. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-10 Table 4.3 Merge operations.

11. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-11 Figure 4.7 Peril-L program using Batcher’s sort to alphabetize records in L.

12. Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 4-12 Figure 4.7 Peril-L program using Batcher’s sort to alphabetize records in L. (cont.)