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
Posted Content
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
Xueliang Li,Yaping Mao +1 more
TL;DR: In this paper, the Nordhaus-Gaddum-type results for the parameter λ-k(G) were considered and sharp upper and lower bounds of λ k(G), λ 2 (G) and λ 3 (G 2 ) were derived for a graph of order n and size m.
Journal ArticleDOI
A Novel Wire-Density-Driven Full-Chip Routing System for CMP Variation Control
TL;DR: This paper presents a new full-chip grid-based routing system considering wire density for reticle planarization enhancement, which applies a novel two-pass top-down planarity-driven routing framework that employs new density critical area analysis based on Voronoi diagrams and incorporates an intermediate stage of a density-driven layer/track assignment based on incremental Delaunay triangulation.
Proceedings ArticleDOI
A DSM design flow: putting floorplanning, technology-mapping, and gate-placement together
TL;DR: An integrated design flow which combines floorplanning, technology mapping, and placement using a dynamic programming algorithm is presented, demonstrating the effectiveness of the proposed flow.
Journal ArticleDOI
On minimally 2-connected graphs with generalized connectivity $$\kappa _{3}=2$$ź3=2
TL;DR: This paper focuses on the structure of minimally 2-connected graphs with kappa _{3}=2$$κ3=2 and obtains that H∈B or H can be constructed from one or some graphs H1,…,Hk in $$\mathcal {B}$$B ($$k\ge 1$$k≥1) by applying some operations recursively.
Proceedings ArticleDOI
Implementing DSP Algorithms with On-Chip Networks
TL;DR: This work addresses two key optimization problems that arise in this context - placement, i.e., assigning computations to PEs on the NoC, and scheduling, ie.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.