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
Solving optimization problems by parallel recombinative simulated annealing on a parallel computer-an application to standard cell placement in VLSI design
TL;DR: The algorithm, its parallel implementation, and its application to an NP-hard problem, namely standard cell placement in very large scale integration (VLSI) chip design, are described.
Journal ArticleDOI
Custom Networks-on-Chip Architectures With Multicast Routing
TL;DR: In this paper, the problem of synthesizing custom networks-on-chip (NoC) architectures that are optimized for a given application is considered, and the problem formulation is based on the decomposition of the problem into the interrelated steps of finding good flow partitions, deriving a good physical network topology for each group in the partition, and providing an optimized network implementation for the derived topologies.
Book ChapterDOI
Bit-Vector Optimization
Alexander Nadel,Vadim Ryvchin +1 more
TL;DR: This paper introduces two OBV algorithms which can easily be implemented in an eager bit-vector solver and shows that an industrial problem of fixing cell placement during the physical design stage of the CAD process can be reduced to optimization modulo either Bit-Vectors BV or Linear Integer Arithmetic LIA.
Journal ArticleDOI
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
Xueliang Li,Yaping Mao +1 more
TL;DR: The Nordhaus-Gaddum-type results for the parameter λ k ( G) are considered and sharp upper and lower bounds are obtained for a graph G of order n and size m are obtained.
Journal ArticleDOI
Thermal sensor allocation and placement for reconfigurable systems
TL;DR: This work proposes an effective solution to the problem of thermal sensor allocation and placement at the post-manufacturing stage, and defines the Sensor Allocation and Placement Problem (SAPP), and proposes a solution which formulates SAPP into the Unate-Covering Problem (UCP) and solves it optimally.
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.