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
General thermal force model with experimental studies
TL;DR: In this paper, a general thermal force model is proposed to extend the applicability of the thermal force to cover general cooling conditions by introducing the concept of the heat transparency of a boundary /spl tau/.
Book ChapterDOI
Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths
Mohsen Safari,Ali Ebnenasir +1 more
TL;DR: This paper presents a novel parallel algorithm for solving the Single-Source Shortest Path (SSSP) problem on GPUs based on the idea of locality-based relaxation, where instead of updating just the distance of a single vertex v, the authors update the distances of v’s neighboring vertices up to k steps.
Proceedings Article
Constraint-based dogleg channel routing with via minimization
TL;DR: An algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem, which has the potential to be used in dealing with other routing problems in VLSI physical design automation.
Patent
Physical design automation system and process for designing integrated circuit chips using generalized assignment
Ranko Scepanovic,James S. Koford,Edwin R. Jones,Valeriy B. Kudryavtsev,Alexander E. Andreev,Stanislav V. Aleshin,Alexander S. Podkolzin +6 more
TL;DR: In this article, an optimal permutation of movement of the selected number of objects between the regions is computed such that a cost corresponding to the total penalties for the assignment is maximally reduced.
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.