Automatic Parallelization
An Overview of Fundamental Compiler Techniques
Published on 27. January 2012
Book
Paperback/Softback
XII, 157 pages
978-3-031-00608-1 (ISBN)
Description
Compiling for parallelism is a longstanding topic of compiler research. This book describes the fundamental principles of compiling "regular" numerical programs for parallelism. We begin with an explanation of analyses that allow a compiler to understand the interaction of data reads and writes in different statements and loop iterations during program execution. These analyses include dependence analysis, use-def analysis and pointer analysis. Next, we describe how the results of these analyses are used to enable transformations that make loops more amenable to parallelization, and discuss transformations that expose parallelism to target shared memory multicore and vector processors. We then discuss some problems that arise when parallelizing programs for execution on distributed memory machines. Finally, we conclude with an overview of solving Diophantine equations and suggestions for further readings in the topics of this book to enable the interested reader to delve deeper into the field. Table of Contents: Introduction and overview / Dependence analysis, dependence graphs and alias analysis / Program parallelization / Transformations to modify and eliminate dependences / Transformation of iterative and recursive constructs / Compiling for distributed memory machines / Solving Diophantine equations / A guide to further reading
More details
Series
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
XII, 157 p.
Dimensions
Height: 235 mm
Width: 191 mm
Thickness: 10 mm
Weight
334 gr
ISBN-13
978-3-031-00608-1 (9783031006081)
DOI
10.1007/978-3-031-01736-0
Schweitzer Classification
Other editions
Additional editions
E-Book
06/2022
Springer
€37.44
Available for download
Person
Samuel Midkiff is a Professor of Electrical and Computer Engineering at Purdue University, where he has been since 2001.He received his PhD degree from the University of Illinois at Urbana-Champaign in 1992 where he was a member of the Cedar project. In 1991 he became a Research Staff Member at the IBM T.J. Watson Research Center, where he was a key member of the xlhpf compiler team and the Numerically INtensive Java (Ninja) project. His research has focused on parallelism and high performance computing, and in particular compiler and language support for the development of correct and efficient programs. To this end, his research has covered dependence analysis and automatic synchronization of explicitly parallel programs, compilation under different memory models,automatic parallelization, high performance computing in Java and other high-level languages,and tools to help in the detection and localization of program errors.
Content
Introduction and overview.- Dependence analysis, dependence graphs and alias analysis.- Program parallelization.- Transformations to modify and eliminate dependences.- Transformation of iterative and recursive constructs.- Compiling for distributed memory machines.- Solving Diophantine equations.- A guide to further reading.