Complexity Issues Vlsi Optimal by Leighton Frank (4 results)

hardback. Complexity Issues in VLSI Optimal Layouts for the Shuffle-Exchange Graph and Other Networks Very good with light shelf wear. No dust wrapper.

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.

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

Paperback. Condition: Brand New. 156 pages. 8.90x5.98x0.39 inches. In Stock.