Scheduling and Automatic Parallelization
Birkhäuser Verlag GmbH
Published in May 2000
Book
Hardback
280 pages
978-3-7643-4149-7 (ISBN)
Article exhausted; check different version
Description
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.
More details
Language
English
Place of publication
Basel
Switzerland
Target group
College/higher education
Professional and scholarly
Illustrations
94 schw.-w. Abb.
Dimensions
Height: 26 cm
Width: 18.4 cm
Weight
600 gr
ISBN-13
978-3-7643-4149-7 (9783764341497)
Schweitzer Classification
Other editions
New editions

Alain Darte | Yves. Robert | Frederic Vivien
Scheduling and Automatic Parallelization
Book
03/2000
Birkhauser Boston Inc
€106.99
Shipment within 15-20 days
Content
Part 1 Unidimensional problems: scheduling DAGs without communications - introduction, where do task graphs come from? scheduling DAGs, solving Pb(oo), solving Pb(oo), conclusion, bibliographical notes, exercises; scheduling DAGs with communications - introduction, a model with communication costs, NP-completeness of Pb(oo), a guaranteed heuristic for Pb(oo), list heuristic for Pb(p), two-step clustering heuristics, linear clustering, conclusion, bibliographical notes, exercises; cycling scheduling - introduction, problem formulation, solving BCS(oo), solving BCS(p), bibliographical notes, exercises. Part 2 Multidimensional problems: systems of uniform recurrence equations - introduction, computability of a SURE, and linear scheduling, SURE and multidimensional scheduling, bibliographical notes exercises; parallelism detection in nested loops - introduction, dependence analysis and abstraction, Allen and Kennedy's algorithm, unimodular transformation, Darte and Vivien's algorithm, Feautrier's algorithm, optimality, bibliographical notes, exercises. Bibliography.