Items related to Complexity Issues in VLSI: Optimal Layouts for the...
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks - Hardcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Tom Leighton is Assistant Professor of Mathematics in the Department of Applied Mathematics and Laboratory for Computer Science at MIT.
"About this title" may belong to another edition of this title.
- PublisherThe MIT Press
- Publication date1983
- ISBN 10 0262121042
- ISBN 13 9780262121040
- BindingHardcover
- LanguageEnglish
- Edition number1
- Number of pages155
Search results for Complexity Issues in VLSI: Optimal Layouts for the...
Seller Image
Complexity Issues in VLSI Optimal Layouts for the Shuffle-Exchange Graph and Other Networks
Published by
The MIT Press 1983 with 139 pages and an index., 1983
ISBN 10: 0262121042
ISBN 13: 9780262121040
Used
Hardcover
Seller: Pacific Rim Used Books LLC, Anacortes, WA, U.S.A.
Seller rating 5 out of 5 stars
hardback. Complexity Issues in VLSI Optimal Layouts for the Shuffle-Exchange Graph and Other Networks Very good with light shelf wear. No dust wrapper. Seller Inventory # 5292
Quantity: 1 available
Stock Image
Complexity Issues in VLSI : Optimal Layouts for the Shuffle-Exchange Graph and Other Networks
Published by
MIT Press, 1983
ISBN 10: 0262121042
ISBN 13: 9780262121040
Used
Hardcover
First Edition
Seller: George Cross Books, Lexington, MA, U.S.A.
Seller rating 5 out of 5 stars
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. Seller Inventory # 17710
Quantity: 1 available
Stock Image
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks (Foundations of computing).
Seller: Kloof Booksellers & Scientia Verlag, Amsterdam, Netherlands
Seller rating 4 out of 5 stars
Condition: 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 : , Seller Inventory # 257056
Quantity: 1 available
Stock Image
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Hardcover. Condition: 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. Seller Inventory # G-122-143
Quantity: 1 available
Stock Image
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Hardcover. Condition: 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. Seller Inventory # G-122-142
Quantity: 1 available
Stock Image
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 8699051
Quantity: 1 available
Stock Image
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks
Seller: dsmbooks, Liverpool, United Kingdom
Seller rating 4 out of 5 stars
hardcover. Condition: Very Good. Very Good. book. Seller Inventory # D8S0-3-M-0262121042-2
Quantity: 1 available