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
Integer Linear Programming Models for Global Routing
TL;DR: A proposed global routing heuristic that combines the wire length, channel congestion, and number of pins in routes to find the best wiring layout of a circuit is proposed.
Journal ArticleDOI
An integrated temporal partitioning and physical design framework for static compilation of reconfigurable computing systems
TL;DR: A new iterative design flow for reconfigurable computing systems is proposed that integrates the synthesis and physical design phases to perform a static compilation process and a new temporal partitioning algorithm for partitioning and scheduling is proposed.
Proceedings ArticleDOI
Delay budgeting for a timing-closure-driven design method
Chien Chu Kuo,Allen C.-H. Wu +1 more
TL;DR: This paper forms the delay-budgeting problem into the Lagrange-Multipliers-based slack distribution problem and presents two algorithms, namely the balanced slack distribution algorithm and the AT-based (Area-Time) slack distribution algorithms to solve the problem.
Journal ArticleDOI
A fast neural-network algorithm for VLSI cell placement
TL;DR: A neural network algorithm is proposed that produces solutions as good as SA in substantially less time and is based on Mean Field Annealing (MFA) technique, which was successfully applied to various combinatorial optimization problems.
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.