Scheduling and Automatic Parallelization (Hardcover)

Alain Darte

ISBN 10: 0817641491 / ISBN 13: 9780817641498

Published by Birkhauser Boston Inc, Secaucus, 2000

About this Item

Hardcover. 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.). This text addresses the study of compiler transformations for parallel aspects of sophisticated scheduling problems, primarily task-graph scheduling and loop-nest scheduling. The presentation is self-contained and complete with detailed code for algorithms, proofs and selected exercise sets. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9780817641498

Bibliographic Details

• Title: Scheduling and Automatic Parallelization (Hardcover)
• Publisher: Birkhauser Boston Inc, Secaucus
• Publication Date: 2000
• Language: English
• ISBN 10: 0817641491
• ISBN 13: 9780817641498
• Binding: Hardcover
• Condition: new

About this title

Synopsis

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.).

Synopsis

This text addresses the study of compiler transformations for parallel aspects of sophisticated scheduling problems, primarily task-graph scheduling and loop-nest scheduling. The presentation is self-contained and complete with detailed code for algorithms, proofs and selected exercise sets.