4. 2 Code Segments . . . . . . . . . . . . . . . 96 4. 3 Determining Communication Parameters . 99 4. 4 Multicast Communication Overhead � 103 4. 5 Partitioning . . . . . . � 103 4. 6 Experimental Results . 117 4. 7 Conclusion. . . . . . . � 121 5 COLLECTIVE PARTITIONING AND REMAPPING FOR MULTIPLE LOOP NESTS 125 5. 1 Introduction. . . . . . . . . 125 5. 2 Program Enclosure Trees. . 128 5. 3 The CPR Algorithm . . 132 5. 4 Experimental Results. . 141 5. 5 Conclusion. . 146 BIBLIOGRAPHY. 149 INDEX . . . . . . . . 157 ...
Read More
4. 2 Code Segments . . . . . . . . . . . . . . . 96 4. 3 Determining Communication Parameters . 99 4. 4 Multicast Communication Overhead � 103 4. 5 Partitioning . . . . . . � 103 4. 6 Experimental Results . 117 4. 7 Conclusion. . . . . . . � 121 5 COLLECTIVE PARTITIONING AND REMAPPING FOR MULTIPLE LOOP NESTS 125 5. 1 Introduction. . . . . . . . . 125 5. 2 Program Enclosure Trees. . 128 5. 3 The CPR Algorithm . . 132 5. 4 Experimental Results. . 141 5. 5 Conclusion. . 146 BIBLIOGRAPHY. 149 INDEX . . . . . . . . 157 LIST OF FIGURES Figure 1. 1 The Butterfly Architecture. . . . . . . . . . 5 1. 2 Example of an iterative data-parallel loop . . 7 1. 3 Contiguous tiling and assignment of an iteration space. 13 2. 1 Communication along a line segment. . . 24 2. 2 Access pattern for the access offset, (3,2). 25 2. 3 Decomposing an access vector along an orthogonal basis set of vectors. . . . . . . . . . . . . . . . . . . 26 2. 4 An analysis of communication patterns. 29 2. 5 Decomposing a vector along two separate basis sets of vectors. 31 2. 6 Cache lines aligning with borders. 33 2. 7 Cache lines not aligned with borders. 34 2. 8 nh is the difference of nd and nb. 42 2. 9 nh is the sum of nd and nb. 42 2. 10 The ADAPT system. 44 2. 11 Code segment used in experiments. . 46 2. 12 Execution rates for various partitions. 47 2. 13 Execution time of partitions on Multimax. 48 2. 14 Performance increase as processing power increases. 49 2. 15 Percentage miss ratios for various aspect ratios and line sizes.
Read Less
Book Details
Seller
Sort
U.K./EUR Sellers
Price: Low to High
Price: High to Low
Pub Date
Pub Date: Reverse
Hardcover,
New
1992, Springer
ISBN-13:
9780792392835
See Item Details ▾
Alibris
BEST
NV, USA
$112.32
Add to Basket
Add this copy of Compiling Parallel Loops for High Performance Computers to cart. $112.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1992 by Springer.
Edition:
1992, Springer
Hardcover,
New
Available Copies: 10+
Details:
ISBN:
0792392833
ISBN-13:
9780792392835
Pages:
159
Edition:
1993 edition
Publisher:
Springer
Published:
1992
Language:
English
Alibris ID:
11225625940
Shipping Options:
Standard Shipping: $4.93
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 159 p. Contains: Unspecified. The Springer International Engineering and Computer Science, 200.
Hide Details ▴
Hardcover,
New
1992, Springer
ISBN-13:
9780792392835
See Item Details ▾
Ria Christie Books
HIGH
Uxbridge,
MIDDLESEX,
UNITED KINGDOM
$122.45
Add to Basket
Add this copy of Compiling Parallel Loops for High Performance Computers to cart. $122.45, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 1992 by Springer.
Edition:
1992, Springer
Hardcover,
New
Available Copies: 10+
Details:
ISBN:
0792392833
ISBN-13:
9780792392835
Pages:
159
Edition:
1993 edition
Publisher:
Springer
Published:
1992
Language:
English
Alibris ID:
18320434115
Shipping Options:
Standard Shipping: $4.93
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 159 p. Contains: Unspecified. The Springer International Engineering and Computer Science, 200.
Hide Details ▴
2012,
Springer, New York, NY
ISBN-13: 9781461363866
Trade paperback
1992,
Springer, New York, NY
ISBN-13: 9780792392835
1993 edition
Hardcover
All Editions of Compiling Parallel Loops for High Performance Computers: Partitioning, Data Assignment and Remapping