Items related to Scheduling and Automatic Parallelization

Scheduling and Automatic Parallelization - Softcover

 
9781461271130: 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.

Product Description

Scheduling and Automatic Parallelization This book offers a detailed and self-contained presentation for studyi ng loop transformations, the detection of parallel loops, and how to u se them to detect parallelism in a specific program. It provides caref ul explanation and exposition for all parallel-loop algorithms that ha ve been designed recently in a framework of scheduling algorithms on c yclic graphs, primarily task graph scheduling and loop nest scheduling perspectives. The book is an essential text/reference for the latest developments in automatic parallelization methods used for scheduling, compilers, and program transformations. Professionals, researchers an d graduates in computer scienc...

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

Buy Used

Condition: As New
Unread book in perfect condition...
View this item

£ 1.96 shipping within U.S.A.

Destination, rates & speeds

Other Popular Editions of the Same Title

Search results for Scheduling and Automatic Parallelization

Stock Image

Darte, Alain; Robert, Yves.; Vivien, Frederic
Published by Birkhäuser, 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
New Softcover

Seller: Best Price, Torrance, CA, U.S.A.

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

Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9781461271130

Contact seller

Buy New

£ 82.89
Convert currency
Shipping: £ 6.66
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Darte, Alain; Robert, Yves.; Vivien, Frederic
Published by Birkhäuser, 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
New Softcover

Seller: GreatBookPrices, Columbia, MD, U.S.A.

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

Condition: New. Seller Inventory # 19850021-n

Contact seller

Buy New

£ 87.72
Convert currency
Shipping: £ 1.96
Within U.S.A.
Destination, rates & speeds

Quantity: 15 available

Add to basket

Stock Image

Darte, Alain; Robert, Yves.; Vivien, Frederic
Published by Birkhäuser, 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

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

Condition: New. Seller Inventory # ABLIING23Mar2716030028554

Contact seller

Buy New

£ 88.20
Convert currency
Shipping: £ 2.96
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Alain Darte
ISBN 10: 1461271134 ISBN 13: 9781461271130
New Paperback

Seller: Grand Eagle Retail, Mason, OH, U.S.A.

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

Paperback. Condition: new. Paperback. 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.). 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 SuperA 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 preceA dence constraints; it is a run-time activity. Loop nest scheduling aims at exA 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 transA formations have been introduced (loop interchange, skewing, fusion, disA tribution, etc.) before a unifying theory emerged. The theory builds upon the pioneering papers of Karp, Miller, and Winograd [65] and of LamA port [75], and it relies on sophisticated mathematical tools (unimodular transformations, parametric integer linear programming, Hermite decomA position, Smithdecomposition, Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781461271130

Contact seller

Buy New

£ 91.23
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Darte, Alain; Robert, Yves.; Vivien, Frederic
Published by Birkhäuser, 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
New Softcover

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 # ria9781461271130_new

Contact seller

Buy New

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

Quantity: Over 20 available

Add to basket

Seller Image

Darte, Alain; Robert, Yves.; Vivien, Frederic
Published by Birkhäuser, 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
Used Softcover

Seller: GreatBookPrices, Columbia, MD, U.S.A.

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

Condition: As New. Unread book in perfect condition. Seller Inventory # 19850021

Contact seller

Buy Used

£ 104.46
Convert currency
Shipping: £ 1.96
Within U.S.A.
Destination, rates & speeds

Quantity: 15 available

Add to basket

Stock Image

Darte, Alain
Published by Birkhauser 2012-12, 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
New PF

Seller: Chiron Media, Wallingford, United Kingdom

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

PF. Condition: New. Seller Inventory # 6666-IUK-9781461271130

Contact seller

Buy New

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

Quantity: 10 available

Add to basket

Seller Image

Alain Darte
Published by Birkhäuser Boston Dez 2012, 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
New Taschenbuch
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

Taschenbuch. 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 # 9781461271130

Contact seller

Buy New

£ 95.99
Convert currency
Shipping: £ 20.03
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Alain Darte
Published by Springer-Verlag New York Inc., 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
New Paperback / softback
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

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 574. Seller Inventory # C9781461271130

Contact seller

Buy New

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

Quantity: Over 20 available

Add to basket

Seller Image

Alain Darte|Yves. Robert|Frederic Vivien
Published by Birkhäuser Boston, 2012
ISBN 10: 1461271134 ISBN 13: 9781461271130
New Softcover
Print on Demand

Seller: moluna, Greven, Germany

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

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 # 4189743

Contact seller

Buy New

£ 82.78
Convert currency
Shipping: £ 42.67
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

There are 8 more copies of this book

View all search results for this book