Optimal Floorplan Area Optimization

Ting Chi Wang; D. F. Wong

doi:10.1109/43.149770

Optimal Floorplan Area Optimization

Ting Chi Wang, D. F. Wong

Office of the Provost

Research output: Contribution to journal › Journal article › peer-review

47 Citations (Scopus)

Abstract

In this paper we present an optimal algorithm for the floorplan area optimization problem. Our algorithm is based on an extension of the technique in [5]. Experimental results indicate that our algorithm is efficient and capable of successfully handling large floorplans. We compare our algorithm with the branch-and-bound optimal algorithm in [7]. The running time of our algorithm is substantially less than that of [7]. For several examples where the algorithm in [7] ran for days and did not terminate, our algorithm produced optimal solutions in a few seconds.

Original language	English
Pages (from-to)	992-1002
Number of pages	11
Journal	IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume	11
Issue number	8
DOIs	https://doi.org/10.1109/43.149770
Publication status	Published - Aug 1992

Scopus Subject Areas

Software
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering

Access to Document

10.1109/43.149770

Cite this

@article{a902f2ec6180426d9f4122b2dd8a2114,

title = "Optimal Floorplan Area Optimization",

abstract = "In this paper we present an optimal algorithm for the floorplan area optimization problem. Our algorithm is based on an extension of the technique in [5]. Experimental results indicate that our algorithm is efficient and capable of successfully handling large floorplans. We compare our algorithm with the branch-and-bound optimal algorithm in [7]. The running time of our algorithm is substantially less than that of [7]. For several examples where the algorithm in [7] ran for days and did not terminate, our algorithm produced optimal solutions in a few seconds.",

author = "Wang, {Ting Chi} and Wong, {D. F.}",

note = "Funding Information: Manuscript received September 18, 1990; revised February 11, 1991. This work was supported in part by the National Science Foundation under Grant MIP-8909586, by the Texas Advanced Research Program under Grant 4096, and by an IBM Faculty Development Award. This paper was recommended by the Editor, A. E. Dunlop. A preliminary version of this paper was presented at the 27th ACM/IEEE Design Automation Conference.",

year = "1992",

month = aug,

doi = "10.1109/43.149770",

language = "English",

volume = "11",

pages = "992--1002",

journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",

issn = "0278-0070",

publisher = "IEEE",

number = "8",

}

TY - JOUR

T1 - Optimal Floorplan Area Optimization

AU - Wang, Ting Chi

AU - Wong, D. F.

N1 - Funding Information: Manuscript received September 18, 1990; revised February 11, 1991. This work was supported in part by the National Science Foundation under Grant MIP-8909586, by the Texas Advanced Research Program under Grant 4096, and by an IBM Faculty Development Award. This paper was recommended by the Editor, A. E. Dunlop. A preliminary version of this paper was presented at the 27th ACM/IEEE Design Automation Conference.

PY - 1992/8

Y1 - 1992/8

N2 - In this paper we present an optimal algorithm for the floorplan area optimization problem. Our algorithm is based on an extension of the technique in [5]. Experimental results indicate that our algorithm is efficient and capable of successfully handling large floorplans. We compare our algorithm with the branch-and-bound optimal algorithm in [7]. The running time of our algorithm is substantially less than that of [7]. For several examples where the algorithm in [7] ran for days and did not terminate, our algorithm produced optimal solutions in a few seconds.

AB - In this paper we present an optimal algorithm for the floorplan area optimization problem. Our algorithm is based on an extension of the technique in [5]. Experimental results indicate that our algorithm is efficient and capable of successfully handling large floorplans. We compare our algorithm with the branch-and-bound optimal algorithm in [7]. The running time of our algorithm is substantially less than that of [7]. For several examples where the algorithm in [7] ran for days and did not terminate, our algorithm produced optimal solutions in a few seconds.

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

U2 - 10.1109/43.149770

DO - 10.1109/43.149770

M3 - Journal article

AN - SCOPUS:0026905725

SN - 0278-0070

VL - 11

SP - 992

EP - 1002

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

IS - 8

ER -

Optimal Floorplan Area Optimization

Abstract

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this