On Optimal Interconnections for VLSI

On Optimal Interconnections for VLSI

Author: Andrew B. Kahng

Publisher: Springer Science & Business Media

ISBN: 9781475723632

Page: 286

Download BOOK

First, the book addresses area minimization, with a focus on near-optimal approximation algorithms for minimum-cost Steiner routing.

On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high-performance, high-density interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area minimization, with a focus on near-optimal approximation algorithms for minimum-cost Steiner routing. In addition to practical implementations of recent methods, the implications of recent results on spanning tree degree bounds and the method of Zelikovsky are discussed. Second, the book addresses delay minimization, starting with a discussion of accurate, yet algorithmically tractable, delay models. Recent minimum-delay constructions are highlighted, including provably good cost-radius tradeoffs, critical-sink routing algorithms, Elmore delay-optimal routing, graph Steiner arborescences, non-tree routing, and wiresizing. Third, the book addresses skew minimization for clock routing and prescribed-delay routing formulations. The discussion starts with early matching-based constructions and goes on to treat zero-skew routing with provably minimum wirelength, as well as planar clock routing. Finally, the book concludes with a discussion of multiple (competing) objectives, i.e., how to optimize area, delay, skew, and other objectives simultaneously. These techniques are useful when the routing instance has heterogeneous resources or is highly congested, as in FPGA routing, multi-chip packaging, and very dense layouts. Throughout the book, the emphasis is on practical algorithms and a complete self-contained development. On Optimal Interconnections for VLSI will be of use to both circuit designers (CAD tool users) as well as researchers and developers in the area of performance-driven physical design.



More Books:

On Optimal Interconnections for VLSI
Language: en
Pages: 286
Authors: Andrew B. Kahng, Gabriel Robins
Categories: Technology & Engineering
Type: BOOK - Published: 2013-04-17 - Publisher: Springer Science & Business Media

On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high-performance, high-density interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area minimization, with a focus on near-optimal approximation algorithms for minimum-cost Steiner routing. In addition to practical implementations of recent methods,
Optimal Interconnection Trees in the Plane
Language: en
Pages: 344
Authors: Marcus Brazil, Martin Zachariasen
Categories: Mathematics
Type: BOOK - Published: 2015-04-13 - Publisher: Springer

This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and
High-Speed VLSI Interconnections
Language: en
Pages: 432
Authors: Ashok K. Goel
Categories: Technology & Engineering
Type: BOOK - Published: 2007-10-19 - Publisher: John Wiley & Sons

This Second Edition focuses on emerging topics and advances in the field of VLSI interconnections In the decade since High-Speed VLSI Interconnections was first published, several major developments have taken place in the field. Now, updated to reflect these advancements, this Second Edition includes new information on copper interconnections, nanotechnology
VLSI Physical Design: From Graph Partitioning to Timing Closure
Language: en
Pages: 310
Authors: Andrew B. Kahng, Jens Lienig, Igor L. Markov, Jin Hu
Categories: Technology & Engineering
Type: BOOK - Published: 2011-01-27 - Publisher: Springer Science & Business Media

Design and optimization of integrated circuits are essential to the creation of new semiconductor chips, and physical optimizations are becoming more prominent as a result of semiconductor scaling. Modern chip design has become so complex that it is largely performed by specialized software, which is frequently updated to address advances
Binary Decision Diagrams and Applications for VLSI CAD
Language: en
Pages: 142
Authors: Shin-ichi Minato
Categories: Technology & Engineering
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

Symbolic Boolean manipulation using binary decision diagrams (BDDs) has been successfully applied to a wide variety of tasks, particularly in very large scale integration (VLSI) computer-aided design (CAD). The concept of decision graphs as an abstract representation of Boolean functions dates back to the early work by Lee and Akers.