Proceedings ArticleDOI
A fast rectangular spreading technique in global placement
Xiaowei Ma,Yongqiang Lv,Haixia Yan,Qiang Zhou +3 more
- Vol. 3
Reads0
Chats0
TLDR
This paper presents a cell shifting aware of spreading direction of cells, rectangular spreading, to drive cells to spread in a rectangular contour, which can afford placement with better distribution of cells in four corners.Abstract:
Cell shifting is an efficient technique of removing overlap and accelerating the convergence of quadratic placement approach. However, this technique does not take the cells' spreading direction into consideration. In our implement of cell shifting, the four corners of the rectilinear region tend to be less occupied by cells, thereby reducing the utilization of the whole region. To solve this problem, in this paper, we present a cell shifting aware of spreading direction of cells, rectangular spreading, to drive cells to spread in a rectangular contour. It can afford placement with better distribution of cells in four corners. Besides, we give a detailed description of our implement of cell shifting.read more
References
More filters
Journal ArticleDOI
GORDIAN: VLSI placement by quadratic programming and slicing optimization
TL;DR: The authors present a placement method for cell-based layout styles that is composed of alternating and interacting global optimization and partitioning steps that are followed by an optimization of the area utilization.
Journal ArticleDOI
An r-Dimensional Quadratic Placement Algorithm
TL;DR: In this paper, the problem of placing n connected points (or nodes) in r-dimensional Euclidean space is given, and the criterion for optimality is minimizing a weighted sum of squared distances between the points subject to quadratic constraints of the form X′X = 1, for each of the r unknown coordinate vectors.
Proceedings ArticleDOI
Generic global placement and floorplanning
Hans Eisenmann,Frank Johannes +1 more
TL;DR: The algorithm is capable of addressing the problems of global placement, floorplanning, timing minimization and interaction to logic synthesis, and its iterative nature assures that timing requirements are precisely met.
Proceedings ArticleDOI
FastPlace: efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model
Natarajan Viswanathan,Chris Chu +1 more
TL;DR: FastPlace-a fast, iterative, flat placement algorithm for large-scale standard cell designs based on the quadratic placement approach that produces a global placement with even cell distribution in a very short time and a hybrid net model that is a combination of the traditional clique and star models.