Articles liés à 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.).
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 89,64
Gratuit expédition vers Etats-Unis
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Scheduling and Automatic Parallelization
Image d'archives
Scheduling and Automatic Parallelization
Edité par
Birkhauser, 2000
ISBN 10 : 0817641491
ISBN 13 : 9780817641498
Ancien ou d'occasion
Couverture rigide
Vendeur : Recycle Bookstore, San Jose, CA, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Hardcover. Etat : 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. N° de réf. du vendeur 998288
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Scheduling and Automatic Parallelization.
Edité par
Boston, Birkhäuser Boston, 2000
ISBN 10 : 0817641491
ISBN 13 : 9780817641498
Ancien ou d'occasion
Couverture rigide
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
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. N° de réf. du vendeur 2341219
Quantité disponible : 1 disponible(s)
Image d'archives
Scheduling and Automatic Parallelization
Edité par
Birkh?user, 2000
ISBN 10 : 0817641491
ISBN 13 : 9780817641498
Ancien ou d'occasion
Couverture rigide
Vendeur : Old Goat Books, Waterloo, ON, Canada
Évaluation du vendeur 4 sur 5 étoiles
Hardcover. Etat : Near Fine. 7.19 X 0.71 X 10.28 inches; 280 pages. N° de réf. du vendeur 1140679
Quantité disponible : 1 disponible(s)
Image d'archives
Scheduling And Automatic Parallelization
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEOCT25-122672
Quantité disponible : 1 disponible(s)
Image d'archives
Scheduling And Automatic Parallelization
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur ABNR-91117
Quantité disponible : 1 disponible(s)
Image d'archives
Scheduling and Automatic Parallelization
Vendeur : ALLBOOKS1, Direk, SA, Australie
Évaluation du vendeur 5 sur 5 étoiles
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address. N° de réf. du vendeur SHAK122672
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Scheduling and Automatic Parallelization
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 206811-n
Quantité disponible : 15 disponible(s)
Image d'archives
Scheduling and Automatic Parallelization
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2416190237538
Quantité disponible : Plus de 20 disponibles
Image d'archives
Scheduling and Automatic Parallelization (Hardcover)
Edité par
Birkhauser Boston Inc, Secaucus, 2000
ISBN 10 : 0817641491
ISBN 13 : 9780817641498
Neuf
Couverture rigide
Vendeur : Grand Eagle Retail, Mason, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. 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. N° de réf. du vendeur 9780817641498
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Scheduling and Automatic Parallelization
Edité par
Birkhäuser, 2000
ISBN 10 : 0817641491
ISBN 13 : 9780817641498
Ancien ou d'occasion
Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 206811
Quantité disponible : 15 disponible(s)