Proceedings ArticleDOI
New placement and global routing algorithms for standard cell layouts
Masato Edahiro,Takeshi Yoshimura +1 more
- pp 642-645
Reads0
Chats0
TLDR
New placement and global routing algorithms are proposed for standard cell layouts that are effective to avoid being trapped in local optimum solutions and are simple and highly efficient.Abstract:
New placement and global routing algorithms are proposed for standard cell layouts. The placement algorithm, called the hierarchical clustering with min-cut exchange (HCME), is effective to avoid being trapped in local optimum solutions. The global routing algorithm does not route the nets one by one and therefore, the results are independent of the net order and channel order. In this algorithm, channel width is minimized under a cost function, in which the trade-off between the minimization of net lengths and the minimization of the number of tracks is considered. These algorithms are simple and highly efficient. This is confirmed by computational experiments.read more
Citations
More filters
Patent
Efficient scatternet forming
TL;DR: In this article, two logically separated scatternets, the maximum connectivity scattternet (MCS) and the traffic scatteret (TS), are provided. But the MCS is maintained autonomously as new nodes arrive to the scatchternet and other nodes leave the scatterternet.
Proceedings ArticleDOI
A cell-replicating approach to minicut-based circuit partitioning
C. Kring,A.R. Newton +1 more
TL;DR: An extension to the Fiduccia and Mattheyses minicut algorithm (1982) allows cells to be replicated in both sides of the partition and can substantially reduce the number of cut nets in a partitioned network below what can be obtained without replication.
Journal ArticleDOI
Edge separability-based circuit clustering with application to multilevel circuit partitioning
Jason Cong,Sung Kyu Lim +1 more
TL;DR: This paper proposes a new efficient O(nlogn) connectivity-based bottom-up clustering algorithm called edge separability-based clustering (ESC), which exploits more global connectivity information using edge separation to guide the clustering process, while carefully monitoring cluster area balance.
Proceedings ArticleDOI
Two-dimensional layout synthesis for large-scale CMOS circuits
TL;DR: The authors propose an algorithm for automatically generating a mask pattern from the logical description of a large-scale CMOS circuit, i.e., 'macro', consisting of up to several thousands of transistors, which yields an 18% smaller layout than the conventional standard cell approach.
Proceedings ArticleDOI
Fault behavior dictionary for simulation of device-level transients
TL;DR: In this article, the authors present a methodology for the simulation of massive number of device-level transient faults and evaluate the fault injection locations and the gate around those locations with SPICE.
References
More filters
Journal ArticleDOI
An efficient heuristic procedure for partitioning graphs
Brian W. Kernighan,Shou-De Lin +1 more
TL;DR: A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Proceedings ArticleDOI
Proud: a fast sea-of-gates placement algorithm
TL;DR: A fast and effective placement algorithm which takes advantage of inherent scarcity in the connectivity specification and solves repeatedly sparse linear equations by the SOR (Successive Over-Relaxation) method in a top-down hierarchy.
Proceedings ArticleDOI
A new global router for row-based layout
K.-W. Lee,Carl Sechen +1 more
TL;DR: A global router for row-based layout styles such as sea-of-gates, gate-array, and standard cell circuits is discussed, generalized to handle macro blocks on the chip, equivalent sets of pins, single pins (those without an equivalent), and circuits having many or no built-into-the-cell feeds.
Book ChapterDOI
GORDIAN: a new global optimization/rectangle dissection method for cell placement
TL;DR: A placement method for cell-based layout styles composed of alternating and interacting global optimization and partitioning phases is presented, which maintains the simultaneous treatment of all cells during optimization over all levels of partitioning.