An optimal algorithm for floorplan area optimization

Ting Chi Wang, D. F. Wong

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

Abstract

An optimal algorithm for the VLSI floorplan area optimization problem is presented. The algorithm is an extension of the technique described by L. Stockmeyer (Information and Control, Vol. 59, pp. 91-101, 1983). Experimental results indicate that this algorithm pruned a very large number of redundant implementations. In addition, since the algorithm basically exploits the geometric property of the topology of the given floorplan, it does not need to depend on the polar dual graphs to calculate the longest paths. Consequently, it is able to run more efficiently than the branch-and-bound algorithm.

Original languageEnglish (US)
Title of host publication27th ACM/IEEE Design Automation Conference. Proceedings 1990
PublisherPubl by IEEE
Pages180-186
Number of pages7
ISBN (Print)081869650X
StatePublished - Dec 1 1990
Externally publishedYes
Event27th ACM/IEEE Design Automation Conference - Orlando, FL, USA
Duration: Jun 24 1990Jun 28 1990

Publication series

Name27th ACM/IEEE Design Automation Conference. Proceedings 1990

Other

Other27th ACM/IEEE Design Automation Conference
CityOrlando, FL, USA
Period6/24/906/28/90

Fingerprint

Topology

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Wang, T. C., & Wong, D. F. (1990). An optimal algorithm for floorplan area optimization. In 27th ACM/IEEE Design Automation Conference. Proceedings 1990 (pp. 180-186). (27th ACM/IEEE Design Automation Conference. Proceedings 1990). Publ by IEEE.

An optimal algorithm for floorplan area optimization. / Wang, Ting Chi; Wong, D. F.

27th ACM/IEEE Design Automation Conference. Proceedings 1990. Publ by IEEE, 1990. p. 180-186 (27th ACM/IEEE Design Automation Conference. Proceedings 1990).

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

Wang, TC & Wong, DF 1990, An optimal algorithm for floorplan area optimization. in 27th ACM/IEEE Design Automation Conference. Proceedings 1990. 27th ACM/IEEE Design Automation Conference. Proceedings 1990, Publ by IEEE, pp. 180-186, 27th ACM/IEEE Design Automation Conference, Orlando, FL, USA, 6/24/90.
Wang TC, Wong DF. An optimal algorithm for floorplan area optimization. In 27th ACM/IEEE Design Automation Conference. Proceedings 1990. Publ by IEEE. 1990. p. 180-186. (27th ACM/IEEE Design Automation Conference. Proceedings 1990).
Wang, Ting Chi ; Wong, D. F. / An optimal algorithm for floorplan area optimization. 27th ACM/IEEE Design Automation Conference. Proceedings 1990. Publ by IEEE, 1990. pp. 180-186 (27th ACM/IEEE Design Automation Conference. Proceedings 1990).
@inproceedings{6614f8c056674fa8bcb0b9dd89df57c2,
title = "An optimal algorithm for floorplan area optimization",
abstract = "An optimal algorithm for the VLSI floorplan area optimization problem is presented. The algorithm is an extension of the technique described by L. Stockmeyer (Information and Control, Vol. 59, pp. 91-101, 1983). Experimental results indicate that this algorithm pruned a very large number of redundant implementations. In addition, since the algorithm basically exploits the geometric property of the topology of the given floorplan, it does not need to depend on the polar dual graphs to calculate the longest paths. Consequently, it is able to run more efficiently than the branch-and-bound algorithm.",
author = "Wang, {Ting Chi} and Wong, {D. F.}",
year = "1990",
month = "12",
day = "1",
language = "English (US)",
isbn = "081869650X",
series = "27th ACM/IEEE Design Automation Conference. Proceedings 1990",
publisher = "Publ by IEEE",
pages = "180--186",
booktitle = "27th ACM/IEEE Design Automation Conference. Proceedings 1990",

}

TY - GEN

T1 - An optimal algorithm for floorplan area optimization

AU - Wang, Ting Chi

AU - Wong, D. F.

PY - 1990/12/1

Y1 - 1990/12/1

N2 - An optimal algorithm for the VLSI floorplan area optimization problem is presented. The algorithm is an extension of the technique described by L. Stockmeyer (Information and Control, Vol. 59, pp. 91-101, 1983). Experimental results indicate that this algorithm pruned a very large number of redundant implementations. In addition, since the algorithm basically exploits the geometric property of the topology of the given floorplan, it does not need to depend on the polar dual graphs to calculate the longest paths. Consequently, it is able to run more efficiently than the branch-and-bound algorithm.

AB - An optimal algorithm for the VLSI floorplan area optimization problem is presented. The algorithm is an extension of the technique described by L. Stockmeyer (Information and Control, Vol. 59, pp. 91-101, 1983). Experimental results indicate that this algorithm pruned a very large number of redundant implementations. In addition, since the algorithm basically exploits the geometric property of the topology of the given floorplan, it does not need to depend on the polar dual graphs to calculate the longest paths. Consequently, it is able to run more efficiently than the branch-and-bound algorithm.

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

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

M3 - Conference contribution

AN - SCOPUS:0025546584

SN - 081869650X

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

SP - 180

EP - 186

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

PB - Publ by IEEE

ER -