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 Computer Vision, Graphics, and Image Processing by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Replicating Atonement by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Vascular Surgery by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Innovations in Bio-Inspired Computing and Applications by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Asset Management for Infrastructure Systems by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book People, Personal Data and the Built Environment by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book The Bright Side and the Dark Side of Patient Empowerment by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Ethical Leadership in Organizations by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Why Are We Attracted to Sad Music? by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Diabetes Mellitus in Developing Countries and Underserved Communities by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book New Developments in Tissue Engineering and Regeneration by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Modern Optimization with R by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Dryland Forests by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Optimal Control in Thermal Engineering by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Who Stole Our Market Economy? 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