Symbolic Parallelization of Nested Loop Programs

Nonfiction, Science & Nature, Technology, Electronics, Circuits, Computers, Advanced Computing, Engineering, Computer Architecture
Cover of the book Symbolic Parallelization of Nested Loop Programs by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich ISBN: 9783319739090
Publisher: Springer International Publishing Publication: February 22, 2018
Imprint: Springer Language: English
Author: Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
ISBN: 9783319739090
Publisher: Springer International Publishing
Publication: February 22, 2018
Imprint: Springer
Language: English

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. 

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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. 

More books from Springer International Publishing

Cover of the book Summability Calculus by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Tuberculosis and Disabled Identity in Nineteenth Century Literature by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book The Magic of Coin-Trees from Religion to Recreation by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book The Progressive Environmental Prometheans by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Marketing Renewable Energy by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Assortment and Merchandising Strategy by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Evil, Fallenness, and Finitude by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book An Introduction to Random Interlacements by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book A Forward-Backward SDEs Approach to Pricing in Carbon Markets by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Doing Qualitative Research in Politics by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Probabilistic Diophantine Approximation by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Systemic Humiliation in America by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Cardiac Management in the Frail Elderly Patient and the Oldest Old by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book CAD, 3D Modeling, Engineering Analysis, and Prototype Experimentation by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Vasculopathies by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy