Open AccessBook
Algorithms for VLSI Physical Design Automation
TLDR
This book is a core reference for graduate students and CAD professionals and presents a balance of theory and practice in a intuitive manner.Abstract:
From the Publisher:
This work covers all aspects of physical design. The book is a core reference for graduate students and CAD professionals. For students, concept and algorithms are presented in an intuitive manner. For CAD professionals, the material presents a balance of theory and practice. An extensive bibliography is provided which is useful for finding advanced material on a topic. At the end of each chapter, exercises are provided, which range in complexity from simple to research level.read more
Citations
More filters
Journal ArticleDOI
Recent directions in netlist partitioning: a survey
TL;DR: This survey describes research directions in netlist partitioning during the past two decades in terms of both problem formulations and solution approaches, and discusses methods which combine clustering with existing algorithms (e.g., two-phase partitioning).
Journal ArticleDOI
NoC synthesis flow for customized domain specific multiprocessor systems-on-chip
Davide Bertozzi,A. Jalabert,Srinivasan Murali,R. Tamhankar,Stergios Stergiou,Luca Benini,G. De Micheli +6 more
TL;DR: This work illustrates a complete synthesis flow, called Netchip, for customized NoC architectures, that partitions the development work into major steps (topology mapping, selection, and generation) and provides proper tools for their automatic execution (SUNMAP, xpipescompiler).
Book ChapterDOI
Graphs and Digraphs
TL;DR: For the list object, introduced in Chapter 5, it was shown that each data element contains at most one predecessor element and one successor element, so for any given data element or node in the list structure, the authors can talk in terms of a next element and a previous element.
Book ChapterDOI
Spanning Trees and Spanners
TL;DR: This work surveys results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
Proceedings ArticleDOI
SUNMAP: a tool for automatic topology selection and generation for NoCs
Srinivasan Murali,G. De Micheli +1 more
TL;DR: SUNMAP automates NoC selection and generation, bridging an important design gap in building NoCs and explores various design objectives such as minimizing average communication delay, area, power dissipation subject to bandwidth and area constraints.
References
More filters
Proceedings ArticleDOI
Partitioning by Probability Condensation
TL;DR: A partitioning model is formulated in which components are assigned probabilities of being placed in bins separated by partitions and minimization of this expected value forces condensation of the probabilities into a "definite" state representing a very good partitioning.
Journal ArticleDOI
Minimization of the number of layers for single row routing with fixed street capacity
TL;DR: A set of three algorithms for solving single-row routine problems with a fixed street capacity using the least number of layers using the main difference among these algorithms is in the strategy used to search for an optimal solution, which greatly affects the performance.
Journal ArticleDOI
Early assessment of design, packaging and technology tradeoffs
TL;DR: It is shown that an early design specification, coupled with a prediction tool, can provide valuable insight into limitations and specific design problem areas, which often only becomes apparent much later in the product cycle.
Proceedings ArticleDOI
Global routing considerations in a cell synthesis system
Dwight D. Hill,Don Shugard +1 more
TL;DR: This paper presents cell synthesis system called Sea Of Devices (SOD), with emphasis on its routing phase, which uses a new model for the global routing problem, based on traditional Steiner trees, but includes detailed geometric information specific to the cell synthesis problem.
Proceedings ArticleDOI
A New Heuristic for Single Row Routing Problems
TL;DR: A new heuristic algorithm for the classical single row routing problem is presented, based on a graph theoretic decomposition scheme and uses modified cut-numbers.