
Scheduling and Automatic Parallelization
Birkhauser Boston Inc (Publisher)
Published on 30. March 2000
Book
Hardback
XVI, 264 pages
978-0-8176-4149-8 (ISBN)
Description
Readership This book is devoted to the study of compiler transformations that are needed to expose the parallelism hiddenin a program. This book is notan introductory book to parallel processing, nor is it an introductory book to parallelizing compilers. Weassume thatreaders are familiar withthebooks High Performance Compilers for Parallel Computingby Wolfe [121] and Super- compilers for Parallel and Vector Computers by Zima and Chapman [125], and that they want to know more about scheduling transformations. In this book we describe both task graph scheduling and loop nest scheduling. Taskgraphschedulingaims atexecuting tasks linked by prece- dence constraints; it is a run-time activity. Loop nest scheduling aims at ex- ecutingstatementinstances linked bydata dependences;it is a compile-time activity. We are mostly interested in loop nestscheduling,butwe also deal with task graph scheduling for two main reasons: (i) Beautiful algorithms and heuristics have been reported in the literature recently; and (ii) Several graphscheduling, like list scheduling, are the basis techniques used in task ofthe loop transformations implemented in loop nest scheduling.
As for loop nest scheduling our goal is to capture in a single place the fantastic developments of the last decade or so. Dozens of loop trans- formations have been introduced (loop interchange, skewing, fusion, dis- tribution, etc.) before a unifying theory emerged. The theory builds upon the pioneering papers of Karp, Miller, and Winograd [65] and of Lam- port [75], and it relies on sophisticated mathematical tools (unimodular transformations, parametric integer linear programming, Hermite decom- position, Smithdecomposition, etc.).
As for loop nest scheduling our goal is to capture in a single place the fantastic developments of the last decade or so. Dozens of loop trans- formations have been introduced (loop interchange, skewing, fusion, dis- tribution, etc.) before a unifying theory emerged. The theory builds upon the pioneering papers of Karp, Miller, and Winograd [65] and of Lam- port [75], and it relies on sophisticated mathematical tools (unimodular transformations, parametric integer linear programming, Hermite decom- position, Smithdecomposition, etc.).
More details
Edition
2000 ed.
Language
English
Place of publication
Boston
United States
Target group
Professional and scholarly
Research
Illustrations
XVI, 264 p.
Dimensions
Height: 260 mm
Width: 183 mm
Thickness: 20 mm
Weight
736 gr
ISBN-13
978-0-8176-4149-8 (9780817641498)
DOI
10.1007/978-1-4612-1362-8
Schweitzer Classification
Other editions
Additional editions

Alain Darte | Yves. Robert | Frederic Vivien
Scheduling and Automatic Parallelization
Book
12/2012
Springer-Verlag New York Inc.
€106.99
Shipment within 15-20 days

Alain Darte | Yves. Robert | Frederic Vivien
Scheduling and Automatic Parallelization
E-Book
12/2012
Birkhäuser
€96.29
Available for download
Previous edition
Alain Darte | Yves P. Robert | Frederic Vivien
Scheduling and Automatic Parallelization
Book
05/2000
Birkhäuser Verlag GmbH
€73.04
Article exhausted; check different version
Content
I Unidimensional Problems.- 1 Scheduling DAGs without Communications.- 2 Scheduling DAGs with Communications.- 3 Cyclic Scheduling.- II Multidimensional Problems.- 4 Systems of Uniform Recurrence Equations.- 5 Parallelism Detection in Nested Loops.