New placement and global routing algorithms for standard cell layouts

Masato Edahiro*, Takeshi Yoshimura

*この研究の対応する著者

研究成果: Conference contribution

10 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル27th ACM/IEEE Design Automation Conference. Proceedings 1990
出版社Publ by IEEE
ページ642-645
ページ数4
ISBN(印刷版)081869650X
DOI
出版ステータスPublished - 1990
イベント27th ACM/IEEE Design Automation Conference - Orlando, FL, USA
継続期間: 1990 6 241990 6 28

出版物シリーズ

名前27th ACM/IEEE Design Automation Conference. Proceedings 1990

Other

Other27th ACM/IEEE Design Automation Conference
CityOrlando, FL, USA
Period90/6/2490/6/28

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「New placement and global routing algorithms for standard cell layouts」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル