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
Proceedings ArticleDOI
Simulated annealing based delay centric VLSI circuit partitioning
TL;DR: Substantial improvement in delay has been obtained over the initial circuit delay justifying the effectiveness of proposed method.
Posted Content
Diametrical Mesh of Tree (D2D-MoT) Architecture: A Novel Routing Solution for NoC
Prasun Ghosal,Sankar Karmakar +1 more
TL;DR: A Mesh routing architecture, which is called Diametrical 2D Mesh of Tree, based on Mesh-of-Tree (MoT) routing and Diametric 2DMesh, which has the advantage of having small diameter as well as large bisection width and small node degree clubbed with being the fastest network in terms of speed.
Journal ArticleDOI
An Application of Multi-parametric Programming in Integrated Circuit Automation (Slotting Problem)
TL;DR: This paper addresses the slotting problem for metal interconnections in integrated circuit automation design for high current conducting metal layers by means of multi-parametric programming and presents a definition of optimization problem for convex shapes of metal layers.
Journal ArticleDOI
On graphs of bounded semilattices
TL;DR: In this article, the authors introduced the intersection graph of the substructures of an algebraic structure and proved general theorems about these graphs, such as that if the graph G(S) is a product of three or more chains, then it is Eulerian if and only if either the length of every chain is even or all the chains are of length one.
Proceedings ArticleDOI
Place and route for massively parallel hardware-accelerated functional verification
TL;DR: This paper presents several compilation strategies that optimize resource allocation to curtail simulation depth, leverage design hierarchy to reduce runtime and memory, and exploit parallel processing to further improve performance.
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.