Upload
pello
View
54
Download
1
Embed Size (px)
DESCRIPTION
Chapter 8: ZPL and Other Global View Languages. Principles of Parallel Programming First Edition by Calvin Lin Lawrence Snyder. Code Spec 8.1 Primitive data types available in ZPL. Code Spec 8.2 Syntax of control statements in ZPL. - PowerPoint PPT Presentation
Citation preview
Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Principles of Parallel Programming
First Edition
by
Calvin Lin
Lawrence Snyder
Chapter 8:ZPL and Other Global View Languages
8-2Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Code Spec 8.1 Primitive data types available in ZPL.
8-3Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Code Spec 8.2 Syntax of control statements in ZPL.
8-4Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Code Spec 8.3 ZPL’s primitive operators and operator-assignments.
8-5Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Figure 8.1 ZPL program that implements Conway’s Game of Life.
8-6Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Code Spec 8.4 Specifying the entry procedure for ZPL.
8-7Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Figure 8.2 The SUMMA matrix multiplication algorithm in ZPL.
8-8Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Code Spec 8.5 Requirements of ZPL’s partial reduce and flood operators.
8-9Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Code Spec 8.6 Requirements of ZPL’s remap operator.
8-10Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Figure 8.3 ZPL program for ranking coffee drinker data.
8-11Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Figure 8.4 Bounding region. Regions used in the program are superimposed so that their indices align; the black square has the same index in all regions. Once aligned, the bounding region is the smallest region containing the indices of the superimposed regions.
8-12Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Figure 8.5 Block allocation of the bounding region. The bounding region (a) is partitioned using a balanced allocation (b), which assigns a set of indices (c). The contributing regions’ indices are inherited from those indices (d).
8-13Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Code Spec 8.7 ZPL performance model.
8-14Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Figure 8.6 A NESL matrix multiplication function.