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 Sepsis by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Technological Entrepreneurship by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Managing for Social Impact by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Time Blind by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Agents and Artificial Intelligence by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Transformations of Global Prosperity by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Probabilistic Methods and Distributed Information by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Coronary Graft Failure by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Influence and Behavior Analysis in Social Networks and Social Media by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Essentials in Stable Angina Pectoris by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Business Process Management Forum by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Advances in Nanocomposites by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Interventional Cardiology in the Elderly by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Digital Research and Education in Architectural Heritage by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Selected Exercises in Particle and Nuclear Physics 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