Symbolic Parallelization of Nested Loop Programs
Buch in deiner Nähe kaufen
Beschreibung
This book introduces new compilation techniques, using the polyhedron model for the resource-adaptive parallel execution of loop programs on massively parallel processor arrays. The authors show how to compute optimal symbolic assignments and parallel schedules of loop iterations at compile time, for cases where the number of available cores becomes known only at runtime. The compile/runtime symbolic parallelization approach the authors describe reduces significantly the runtime overhead, compared to dynamic or just‐in-time compilation. The new, on‐demand fault‐tolerant loop processing approach described in this book protects loop nests for parallel execution against soft errors.
This book introduces new compilation techniques, using the polyhedron model for the resource-adaptive parallel execution of loop programs on massively parallel processor arrays. The authors show how to compute optimal symbolic assignments and parallel schedules of loop iterations at compile time, for cases where the number of available cores becomes known only at runtime. The compile/runtime symbolic parallelization approach the authors describe reduces significantly the runtime overhead, compared to dynamic or just‐in-time compilation. The new, on‐demand fault‐tolerant loop processing approach described in this book protects loop nests for parallel execution against soft errors.
Provides extensive experimental evaluations, investigating the benefits of using symbolic compilation techniques, as well as on-demand fault tolerant loop processing Presents techniques in a step-by-step manner, supported by examples and figures Explains compiler transformations using sound and rigorous mathematical models
Autor*in
Alexandru-Petru Tanase
Themen in »Symbolic Parallelization of Nested Loop Programs«
Invasive Computing Heterogeneous Multiprocessor-On-A-Chip Parallel Computing Polyhedron Model Compiler Optimizations