Loop Tiling for Parallelism: The Springer International Series in Engineering and Computer Science, cartea 575
Autor Jingling Xueen Limba Engleză Hardback – 31 aug 2000
Features and key topics:
- Detailed review of the mathematical foundations, including convex polyhedra and cones;
- Self-contained treatment of nonsingular loop transformations, code generation, and full loop permutability;
- Tiling loop nests by rectangles and parallelepipeds, including their mathematical definition, dependence analysis, legality test, and code generation;
- A complete suite of techniques for generating SPMD code for a tiled loop nest;
- Up-to-date results on tile size and shape selection for reducing communication and improving parallelism;
- End-of-chapter references for further reading.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 824.46 lei 39-44 zile | |
Springer Us – 12 oct 2012 | 824.46 lei 39-44 zile | |
Hardback (1) | 835.12 lei 39-44 zile | |
Springer Us – 31 aug 2000 | 835.12 lei 39-44 zile |
Din seria The Springer International Series in Engineering and Computer Science
- Preț: 262.69 lei
- Preț: 837.70 lei
- 24% Preț: 977.09 lei
- 20% Preț: 708.24 lei
- Preț: 193.79 lei
- 20% Preț: 522.45 lei
- Preț: 1151.55 lei
- 23% Preț: 887.11 lei
- Preț: 350.94 lei
- 23% Preț: 598.34 lei
- 24% Preț: 1031.27 lei
- 24% Preț: 758.06 lei
- 20% Preț: 551.31 lei
- 24% Preț: 742.55 lei
- 20% Preț: 562.54 lei
- 20% Preț: 521.06 lei
- 20% Preț: 557.75 lei
- 24% Preț: 743.26 lei
- 20% Preț: 558.87 lei
- 20% Preț: 828.36 lei
- 20% Preț: 561.42 lei
- 24% Preț: 739.50 lei
- 20% Preț: 829.48 lei
- 24% Preț: 755.57 lei
- 20% Preț: 559.74 lei
- 20% Preț: 529.49 lei
- 24% Preț: 744.81 lei
- 24% Preț: 979.29 lei
- 24% Preț: 756.56 lei
- 20% Preț: 568.39 lei
- 24% Preț: 742.05 lei
- 24% Preț: 740.27 lei
- 20% Preț: 1113.35 lei
- 20% Preț: 1268.49 lei
- 20% Preț: 1115.27 lei
Preț: 835.12 lei
Preț vechi: 1043.90 lei
-20%
Puncte Express: 1253
Preț estimativ în valută:
159.99€ • 173.70$ • 137.21£
159.99€ • 173.70$ • 137.21£
Carte tipărită la comandă
Livrare economică 06-11 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792379331
ISBN-10: 0792379330
Pagini: 256
Ilustrații: XIX, 256 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.57 kg
Ediția:2000
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 0792379330
Pagini: 256
Ilustrații: XIX, 256 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.57 kg
Ediția:2000
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchDescriere
Loop tiling, as one of the most important compiler optimizations, is beneficial for both parallel machines and uniprocessors with a memory hierarchy. This book explores the use of loop tiling for reducing communication cost and improving parallelism for distributed memory machines. The author provides mathematical foundations, investigates loop permutability in the framework of nonsingular loop transformations, discusses the necessary machineries required, and presents state-of-the-art results for finding communication- and time-minimal tiling choices. Throughout the book, theorems and algorithms are illustrated with numerous examples and diagrams. The techniques presented in Loop Tiling for Parallelism can be adapted to work for a cluster of workstations, and are also directly applicable to shared-memory machines once the machines are modeled as BSP (Bulk Synchronous Parallel) machines.
Features and key topics:
Features and key topics:
- Detailed review of the mathematical foundations, including convex polyhedra and cones;
- Self-contained treatment of nonsingular loop transformations, code generation, and full loop permutability;
- Tiling loop nests by rectangles and parallelepipeds, including their mathematical definition, dependence analysis, legality test, and code generation;
- A complete suite of techniques for generating SPMD code for a tiled loop nest;
- Up-to-date results on tile size and shape selection for reducing communication and improving parallelism;
- End-of-chapter references for further reading.
Cuprins
List of Figures. List of Tables. Preface. Acknowledgments. Part I: Mathematic Background and Loop Transformation. 1. Mathematical Background. 2. Nonsingular Transformations and Permutability. Part II: Tiling as a Loop Transformation. 3. Rectangular Tiling. 4. Parallelepiped Tiling. Part III: Tiling for Distributed-Memory Machines. 5. SPMD Code Generation. 6. Communication-Minimal Tiling. 7. Time-Minimal Tiling. Bibliography. Index.