This book solves several mathematical problems in the areas of Very Large Scale Integration (VLSI) and parallel computation. In particular, it describes optimal layouts for the shuffle-exchange graph, one of the best known networks for parallel computation. Attempts to design a shuffle-exchange computer have been hampered in part by the fact that, until now, no good layouts for the shuffle-exchange graph were known.The mesh of trees network (which may eventually prove as useful as the shuffle-exchange graph) is introduced and the book shows how it can be used to perform a variety of computations, including sorting and matrix multiplication, in a logarithmic number of steps.Next, the book introduces the tree of meshes, the first planar graph that was discovered not to have a linear-area layout. Most recently, the structure of this graph has been used to develop a general framework for solving VLSI graph layout problems.Finally, the book develops techniques for proving lower bounds on the bisection width, crossing number, and layout area of a graph. These techniques significantly extend the power and range of previous methods.Researchers in the fields of VLSI, parallel computation, and graph theory will find this study of particular value; it is also accessible to anyone with an elementary knowledge of mathematics and computer science. The book is self-contained and presents in a unified and original manner many results scattered in the technical literature, while also covering new and fundamental results for the first time.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Book by Leighton Frank Thomson
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Pacific Rim Used Books LLC, Anacortes, WA, U.S.A.
hardback. Complexity Issues in VLSI Optimal Layouts for the Shuffle-Exchange Graph and Other Networks Very good with light shelf wear. No dust wrapper. Codice articolo 5292
Quantitą: 1 disponibili
Da: George Cross Books, Lexington, MA, U.S.A.
Hardcover. First edition. Very Good/No Jacket (17710) WARMLY INSCRIBED BY AUTHOR (Tom Leighton). No dust jacket, as issued. Clean, tight, unmarked. Small dent on front board. . 139. Codice articolo 17710
Quantitą: 1 disponibili
Da: Ammareal, Morangis, Francia
Hardcover. Condizione: Bon. Ancien livre de bibliothčque avec équipements. Edition 1983. Ammareal reverse jusqu'ą 15% du prix net de cet article ą des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Edition 1983. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo G-122-143
Quantitą: 1 disponibili
Da: Ammareal, Morangis, Francia
Hardcover. Condizione: Bon. Ancien livre de bibliothčque avec équipements. Edition 1983. Ammareal reverse jusqu'ą 15% du prix net de cet article ą des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Edition 1983. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo G-122-142
Quantitą: 1 disponibili
Da: Kloof Booksellers & Scientia Verlag, Amsterdam, Paesi Bassi
Condizione: as new. Cambridge, MA: The MIT Press, 1983. Hardcover. 155 pp.- This book solves several mathematical problems in the areas of Very Large Scale Integration (VLSI) and parallel computation. In particular, it describes optimal layouts for the shuffle-exchange graph, one of the best known networks for parallel computation. Attempts to design a shuffle-exchange computer have been hampered in part by the fact that, until now, no good layouts for the shuffle-exchange graph were known. The mesh of trees network (which may eventually prove as useful as the shuffle-exchange graph) is introduced and the book shows how it can be used to perform a variety of computations, including sorting and matrix multiplication, in a logarithmic number of steps. Next, the book introduces the tree of meshes, the first planar graph that was discovered not to have a linear-area layout. Most recently, the structure of this graph has been used to develop a general framework for solving VLSI graph layout problems. English text. Condition : as new. Condition : as new copy. ISBN 9780262121040. Keywords : , Codice articolo 257056
Quantitą: 1 disponibili
Da: Anybook.com, Lincoln, Regno Unito
Condizione: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,550grams, ISBN:0262121042. Codice articolo 8699051
Quantitą: 1 disponibili