Items related to Scheduling and Automatic Parallelization

Scheduling and Automatic Parallelization - Hardcover

 
9780817641498: Scheduling and Automatic Parallelization

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" may belong to another edition of this title.

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.

"About this title" may belong to another edition of this title.

Buy Used

275 S. Ehem. Bibliotheksexemplar...
View this item

£ 6.08 shipping from Germany to United Kingdom

Destination, rates & speeds

Buy New

View this item

FREE shipping from U.S.A. to United Kingdom

Destination, rates & speeds

Other Popular Editions of the Same Title

Search results for Scheduling and Automatic Parallelization

Seller Image

Alain, Darte:
Published by Boston, Birkhäuser Boston, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
Used Hardcover

Seller: Antiquariat Bookfarm, Löbnitz, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. 275 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780817641498 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2341219

Contact seller

Buy Used

£ 60.98
Convert currency
Shipping: £ 6.08
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

0
Published by Birkhäuser, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
New Hardcover

Seller: Basi6 International, Irving, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-130061

Contact seller

Buy New

£ 73.93
Convert currency
Shipping: FREE
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Darte, Alain; Robert, Yves.; Vivien, Frederic
Published by Birkhäuser, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
New Hardcover

Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Seller Inventory # ABNR-91117

Contact seller

Buy New

£ 73.93
Convert currency
Shipping: FREE
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Darte, Alain; Robert, Yves.; Vivien, Frederic
Published by Birkhäuser, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
New Hardcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9780817641498_new

Contact seller

Buy New

£ 97.62
Convert currency
Shipping: FREE
Within United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Alain Darte|Yves. Robert|Frederic Vivien
Published by Birkhäuser Boston, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
New Hardcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.Reade. Seller Inventory # 5975679

Contact seller

Buy New

£ 82.50
Convert currency
Shipping: £ 21.69
From Germany to United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Alain Darte
Published by Birkhäuser Boston Mrz 2000, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
New Hardcover
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 withth Elektronisches Buch 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.). 284 pp. Englisch. Seller Inventory # 9780817641498

Contact seller

Buy New

£ 95.66
Convert currency
Shipping: £ 9.55
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Darte, Alain; Robert, Yves; Vivien, Frederic
Published by Birkhauser, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
Used Hardcover

Seller: Recycle Bookstore, San Jose, CA, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Hardcover. Condition: Near Fine. This book has a former owner's name on the pasted down front endpage, rubbing and surface scratching to both covers, sunfading to the spine, and very minor shelfwear to the edges and corners of the covers, otherwise this book is in excellent, like new condition with crisp, unmarked pages, a tight binding, and a clean, glossy cover. Seller Inventory # 998288

Contact seller

Buy Used

£ 57.39
Convert currency
Shipping: £ 49.07
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Alain Darte
ISBN 10: 0817641491 ISBN 13: 9780817641498
New Hardcover

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 withth Elektronisches Buch 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.). Seller Inventory # 9780817641498

Contact seller

Buy New

£ 102.25
Convert currency
Shipping: £ 12.14
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Alain Darte
Published by Birkhauser Boston Inc, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
New Hardcover
Print on Demand

Seller: THE SAINT BOOKSTORE, Southport, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 741. Seller Inventory # C9780817641498

Contact seller

Buy New

£ 115.59
Convert currency
Shipping: FREE
Within United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Alain Darte Yves. Robert Frederic Vivien
Published by Springer, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
Used Hardcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: Used. pp. 284. Seller Inventory # 26300490

Contact seller

Buy Used

£ 112.61
Convert currency
Shipping: £ 6.69
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

There are 5 more copies of this book

View all search results for this book