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 Precision Molecular Pathology of Liver Cancer by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Emerging Research Challenges and Opportunities in Computational Social Network Analysis and Mining by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Fuzzy Logic for Image Processing by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Endophytes of Forest Trees by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Value-Creating Global Citizenship Education by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Synthetic Biology Analysed by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Opportunistic Mobile Networks by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Black Children in Hollywood Cinema by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Augmented Reality, Virtual Reality, and Computer Graphics by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Entrepreneurial Behaviour by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Galactic and Intergalactic Magnetic Fields by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Spectroscopy of Semiconductors by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Ionospheric Space Weather by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book Heavy WIMP Effective Theory by Alexandru-Petru Tanase, Frank Hannig, Jürgen Teich
Cover of the book EU Emergency Response Policies and NGOs 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