New placement and global routing algorithms for standard cell layouts

Masato Edahiro, Takeshi Yoshimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

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.

Original languageEnglish
Title of host publication27th ACM/IEEE Design Automation Conference. Proceedings 1990
PublisherPubl by IEEE
Pages642-645
Number of pages4
ISBN (Print)081869650X
DOIs
Publication statusPublished - 1990
Event27th ACM/IEEE Design Automation Conference - Orlando, FL, USA
Duration: 1990 Jun 241990 Jun 28

Publication series

Name27th 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

  • Engineering(all)

Fingerprint Dive into the research topics of 'New placement and global routing algorithms for standard cell layouts'. Together they form a unique fingerprint.

Cite this