New placement and global routing algorithms for standard cell layouts

Masato Edahiro, Takeshi Yoshimura

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

11 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
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages642-645
Number of pages4
ISBN (Print)081869650X
Publication statusPublished - 1990
Externally publishedYes
Event27th ACM/IEEE Design Automation Conference - Orlando, FL, USA
Duration: 1990 Jun 241990 Jun 28

Other

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

Fingerprint

Routing algorithms
Cost functions
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Edahiro, M., & Yoshimura, T. (1990). New placement and global routing algorithms for standard cell layouts. In 27th ACM/IEEE Design Automation Conference. Proceedings 1990 (pp. 642-645). Piscataway, NJ, United States: Publ by IEEE.

New placement and global routing algorithms for standard cell layouts. / Edahiro, Masato; Yoshimura, Takeshi.

27th ACM/IEEE Design Automation Conference. Proceedings 1990. Piscataway, NJ, United States : Publ by IEEE, 1990. p. 642-645.

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

Edahiro, M & Yoshimura, T 1990, New placement and global routing algorithms for standard cell layouts. in 27th ACM/IEEE Design Automation Conference. Proceedings 1990. Publ by IEEE, Piscataway, NJ, United States, pp. 642-645, 27th ACM/IEEE Design Automation Conference, Orlando, FL, USA, 90/6/24.
Edahiro M, Yoshimura T. New placement and global routing algorithms for standard cell layouts. In 27th ACM/IEEE Design Automation Conference. Proceedings 1990. Piscataway, NJ, United States: Publ by IEEE. 1990. p. 642-645
Edahiro, Masato ; Yoshimura, Takeshi. / New placement and global routing algorithms for standard cell layouts. 27th ACM/IEEE Design Automation Conference. Proceedings 1990. Piscataway, NJ, United States : Publ by IEEE, 1990. pp. 642-645
@inproceedings{e608fea7dd454ae295aabb9dafde9a52,
title = "New placement and global routing algorithms for standard cell layouts",
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.",
author = "Masato Edahiro and Takeshi Yoshimura",
year = "1990",
language = "English",
isbn = "081869650X",
pages = "642--645",
booktitle = "27th ACM/IEEE Design Automation Conference. Proceedings 1990",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - New placement and global routing algorithms for standard cell layouts

AU - Edahiro, Masato

AU - Yoshimura, Takeshi

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025560716&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025560716&partnerID=8YFLogxK

M3 - Conference contribution

SN - 081869650X

SP - 642

EP - 645

BT - 27th ACM/IEEE Design Automation Conference. Proceedings 1990

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -