Heuristic algorithms for standard cell placement in VLSI design = 집적회로 설계시에 표준셀 배치문제를 위한 휴리스틱 알고리즘에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 261
  • Download : 0
In this thesis, we consider the standard cell placement problem in VLSI design works. At first, we present two fast heuristic algorithms for the constructive placement of standard cells based on Constrainted Multi-Stage Graph(CMSG) model for the rectangle-shaped chip. One has a linear time complexity and another has $O(n^{1.5})$ time complexity in the number of cells. Experimental results on the benchmarking testing data show that the proposed algorithms yield near optimal results in terms of the feed-through cells and channel density, which was verified by the comparison of the proposed algorithm with the simulated annealing and other iterative improvement algorithms. So the ample experimental results prove that CMSG model is a naturally reasonable and more efficient model for standard cell placement in the rectangle region than models of the previously studied algorithm such as min-cut partition. Moreover we studied the standard cell placement for the arbitrary rectilinear region, which is the remaining region after some macro modules such as ROM, RAM and PLA were placed in building block design. For this problem we propose a new model called Flow Model in the Closed Region (FMCR). In FMDR the quantity of flows running over the boundary is approximated to the number of signal wires crossing over the boundary line. Rather than placement in the rectangle, arbitrary rectilinear region may have a very congested region, which is carefully considered. So it is a critical work to suppress the number of wires on the region to guarantee the complete routing work. For this we propose the concept of the maximal flow-density for the plane subdivision. We proved that partition which maximizes the flow-density is the bipartition. And some properties on the maximal flow density bipartition are characterized. Several experiments to support the validity of our flow model are presented. By these experiments we show that the proposed algorithm gives the comparable wiring length...
Advisors
Chwa, Kyung-Yongresearcher좌경룡researcher
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
1989
Identifier
61498/325007 / 000845326
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 1989, [ vii, 96 p. ]

URI
http://hdl.handle.net/10203/32978
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=61498&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0