My Account Log in

1 option

Automatic Parallelization : An Overview of Fundamental Compiler Techniques / by Samuel Midkiff.

Springer Nature Synthesis Collection of Technology Collection 4 Available online

View online
Format:
Book
Author/Creator:
Midkiff, Samuel., Author.
Series:
Synthesis Lectures on Computer Architecture, 1935-3243
Language:
English
Subjects (All):
Electronic circuits.
Microprocessors.
Computer architecture.
Electronic Circuits and Systems.
Processor Architectures.
Local Subjects:
Electronic Circuits and Systems.
Processor Architectures.
Physical Description:
1 online resource (XII, 157 p.)
Edition:
1st ed. 2012.
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2012.
Summary:
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.
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.
ISBN:
9783031017360
3031017366

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account