A graph theoretic technique to speed up floorplan area optimization

Ting Chi Wang; D.F. Wong

doi:10.1109/DAC.1992.227860

A graph theoretic technique to speed up floorplan area optimization

Ting Chi Wang, D.F. Wong

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding

9 Citations (Scopus)

Abstract

The authors present two algorithms to optimally select implementations for rectangular and L-shaped subfloorplans. The algorithms are designed specifically for the floorplan optimization algorithm given by T.-C. Wang and D.F. Wong (see Proc. 27th ACM/IEEE Des. Autom. Conf., p.180-6 (1990)), but they can also be applied to other algorithms as well. The experimental results, based on incorporating the two algorithms into Wang's algorithm, whose performance was considerably improved were very encouraging. For the test runs where Wang's algorithm failed to run, the algorithms helped to produce satisfactory solutions.

Original language	English
Title of host publication	29th ACM/IEEE Design Automation Conference - Proceedings 1992
Publisher	IEEE
Pages	62-68
Number of pages	7
ISBN (Print)	0818628227, 9780897915168
DOIs	https://doi.org/10.1109/DAC.1992.227860
Publication status	Published - 12 Jun 1992
Event	29th ACM/IEEE Design Automation Conference, DAC 1992 - Anaheim, United States Duration: 8 Jun 1992 → 12 Jun 1992 https://ieeexplore.ieee.org/xpl/conhome/411/proceeding https://dl.acm.org/doi/proceedings/10.5555/113938

Publication series

Name	ACM/IEEE Design Automation Conference - Proceedings
ISSN (Print)	0738-100X

Conference

Conference	29th ACM/IEEE Design Automation Conference, DAC 1992
Country/Territory	United States
City	Anaheim
Period	8/06/92 → 12/06/92
Internet address	https://ieeexplore.ieee.org/xpl/conhome/411/proceeding https://dl.acm.org/doi/proceedings/10.5555/113938

User-Defined Keywords

Topology
Algorithm design and analysis
Testing
Design optimization
Shortest path problem
Polynomials

Access to Document

10.1109/DAC.1992.227860

Cite this

@inproceedings{95cda931aa7347e59308eaf2678bcb43,

title = "A graph theoretic technique to speed up floorplan area optimization",

abstract = "The authors present two algorithms to optimally select implementations for rectangular and L-shaped subfloorplans. The algorithms are designed specifically for the floorplan optimization algorithm given by T.-C. Wang and D.F. Wong (see Proc. 27th ACM/IEEE Des. Autom. Conf., p.180-6 (1990)), but they can also be applied to other algorithms as well. The experimental results, based on incorporating the two algorithms into Wang's algorithm, whose performance was considerably improved were very encouraging. For the test runs where Wang's algorithm failed to run, the algorithms helped to produce satisfactory solutions.",

keywords = "Topology, Algorithm design and analysis, Testing, Design optimization, Shortest path problem, Polynomials",

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

year = "1992",

month = jun,

day = "12",

doi = "10.1109/DAC.1992.227860",

language = "English",

isbn = "0818628227",

series = "ACM/IEEE Design Automation Conference - Proceedings",

publisher = "IEEE",

pages = "62--68",

booktitle = "29th ACM/IEEE Design Automation Conference - Proceedings 1992",

address = "United States",

note = "29th ACM/IEEE Design Automation Conference, DAC 1992 ; Conference date: 08-06-1992 Through 12-06-1992",

url = "https://ieeexplore.ieee.org/xpl/conhome/411/proceeding, https://dl.acm.org/doi/proceedings/10.5555/113938",

}

TY - GEN

T1 - A graph theoretic technique to speed up floorplan area optimization

AU - Wang, Ting Chi

AU - Wong, D.F.

PY - 1992/6/12

Y1 - 1992/6/12

N2 - The authors present two algorithms to optimally select implementations for rectangular and L-shaped subfloorplans. The algorithms are designed specifically for the floorplan optimization algorithm given by T.-C. Wang and D.F. Wong (see Proc. 27th ACM/IEEE Des. Autom. Conf., p.180-6 (1990)), but they can also be applied to other algorithms as well. The experimental results, based on incorporating the two algorithms into Wang's algorithm, whose performance was considerably improved were very encouraging. For the test runs where Wang's algorithm failed to run, the algorithms helped to produce satisfactory solutions.

AB - The authors present two algorithms to optimally select implementations for rectangular and L-shaped subfloorplans. The algorithms are designed specifically for the floorplan optimization algorithm given by T.-C. Wang and D.F. Wong (see Proc. 27th ACM/IEEE Des. Autom. Conf., p.180-6 (1990)), but they can also be applied to other algorithms as well. The experimental results, based on incorporating the two algorithms into Wang's algorithm, whose performance was considerably improved were very encouraging. For the test runs where Wang's algorithm failed to run, the algorithms helped to produce satisfactory solutions.

KW - Topology

KW - Algorithm design and analysis

KW - Testing

KW - Design optimization

KW - Shortest path problem

KW - Polynomials

UR - https://ieeexplore.ieee.org/document/227860/

UR - https://dl.acm.org/doi/10.5555/113938.110429

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-0026994627&origin=inward

U2 - 10.1109/DAC.1992.227860

DO - 10.1109/DAC.1992.227860

M3 - Conference proceeding

SN - 0818628227

SN - 9780897915168

T3 - ACM/IEEE Design Automation Conference - Proceedings

SP - 62

EP - 68

BT - 29th ACM/IEEE Design Automation Conference - Proceedings 1992

PB - IEEE

T2 - 29th ACM/IEEE Design Automation Conference, DAC 1992

Y2 - 8 June 1992 through 12 June 1992

ER -

A graph theoretic technique to speed up floorplan area optimization

Abstract

Publication series

Conference

User-Defined Keywords

Access to Document

Other files and links

Cite this