Librería: Recycle Bookstore, San Jose, CA, Estados Unidos de America
EUR 67,50
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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.
EUR 65,74
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Near Fine. Estado de la sobrecubierta: Near Fine. Condition: 'Near Fine' Notes: 7.19 X 0.71 X 10.28 inches; 280 pages.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 90,02
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 90,74
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Idioma: Inglés
Publicado por Boston, Birkhäuser Boston, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
EUR 68,20
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. 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.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 113,23
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Used. pp. 284.
EUR 116,16
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Used. pp. 284 Illus.
EUR 115,00
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Used. pp. 284.
EUR 116,51
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 132,01
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 137,03
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2000. Hardcover. . . . . .
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 173,06
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2000. Hardcover. . . . . . Books ship from the US and Ireland.
Idioma: Inglés
Publicado por Birkhäuser Boston, Birkhäuser Boston, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 114,36
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: 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.).
EUR 169,56
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 202,30
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Birkhäuser Boston Mrz 2000, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 106,99
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: 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.
Librería: moluna, Greven, Alemania
EUR 92,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: 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.
Idioma: Inglés
Publicado por Birkhäuser, Birkhäuser Mär 2000, 2000
ISBN 10: 0817641491 ISBN 13: 9780817641498
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 284 pp. Englisch.