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
Reliability and wireability optimizations for chip placement on multichip modules
TL;DR: In this paper, the authors present a solution methodology for the optimal placement problem considering both thermal and routing design objectives simultaneously, which is achieved through use of a hybrid-force model that is a combination of the traditional interconnection force model and a novel thermal force model.
Book ChapterDOI
Modeling the Engineering Process as a Thinging Machine: A Case Study of Chip Manufacturing
Sabah Al-Fedaghi,Aya Hassouneh +1 more
TL;DR: The ability of a TM to provide an environment for managing the manufacturing of integrated circuits and supporting high-level control policies and a new technique called a thinging machine (TM) to develop conceptual modeling in this context are demonstrated.
Book ChapterDOI
Isothetic polygonal approximations of a 2d object on generalized grid
TL;DR: A novel algorithm is presented for constructing the outer (or inner) tight isothetic polygon(s) containing (or filling) an arbitrarily shaped 2D object on a background grid, using a classical labeling technique.
Proceedings ArticleDOI
A time-optimal algorithm for guard zone problem
TL;DR: A time-optimal sequential algorithm to solve the guard zone problem of a simple polygon P such that there exists no pair of points p and q having their Euclidean distance less than r.
Book ChapterDOI
Hybrid Approach for Graph Partitioning
TL;DR: The paper discusses hybrid algorithm based on the elements grouping for the graph partitioning problem which is one of the most important optimization problem in the decision making and develops software which allows to carry out experiments and theoretical estimations of algorithm efficiency were confirmed.
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.