Article

Free access

A unified approach to topology generation and area optimization of general floorplans

Authors:

Partha S. Dasgupta,

Susmita Sur-Kolay,

Bhargab B. BhattacharyaAuthors Info & Claims

ICCAD '95: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design

Pages 712 - 715

Published: 01 December 1995 Publication History

PDF eReader Publisher Site

Abstract

In this paper, it is shown that for any rectangularly dualizable graph, a feasible topology can be obtained by using only either straight or Z-cutlines recursively within a bounding rectangle. Given an adjacency graph, a potential topology, which may be nonslicible and is likely to yield an optimally sized floorplan, is produced first in a top-down fashion using heuristic search in AND-OR graphs. The advantage of this technique is fourfold : (i) accelerates top-down search phase, (ii) generates a floorplan with minimal number of nonslice cores, (iii) ensures safe routing order without addition of pseudo-modules, and (iv) solves the bottom-up algorithm efficiently for optimal sizing of general floorplans in the second phase.

References

[1]

A. Bagchi and A. Mahanti, Admissible Heuristic Search in AND/OR Graphs, Theoretical Computer Science, 24, 1983, 207-219.

Crossref

Google Scholar

[2]

P.S. Dasgupta, S. Sur-Kolay and B.B. Bhattacharya, manuscript, 1995.

Google Scholar

[3]

----, VLSI Floorplan Generation and Area Optimization using AND-OR Graph Search, Proc. 8th Intl. Conf. on VLSI Design, 1995, 370-375.

Digital Library

Google Scholar

[4]

T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout Design, Wiley, 1990.

Digital Library

Google Scholar

[5]

P. Pan and C.L. Liu, Area Minimization for Floorplans, IEEE TCAD, Vol. 14, No. 1, 1995, 123-132.

Digital Library

Google Scholar

[6]

P. Pan, W. Shi, C.L. Liu, Area Minimization for Hierarchical Floorplans, Proc. ICCAD, 1994, 436-440.

Digital Library

Google Scholar

[7]

S. Sur-Kolay and B.B. Bhattacharya, The Cycle Structure of Channel Graphs in Nonslicible Floorplans and A Unified Algorithm for Feasible Routing Order, Proc. ICCD, 1991, 524-527.

Digital Library

Google Scholar

[8]

----, On the family of Inherently Nonslicible Floorplans in VLSI Layout Design, Proc. ISCAS, June 1991, Singapore, 2850-2853.

Crossref

Google Scholar

[9]

----, Canonical Embedding of Rectangular Duals with Applications to VLSI Floorplanning,Proc. DAC, June 1992, 69-74.

Digital Library

Google Scholar

[10]

T.C. Wang and D.F. Wong, Optimal Floorplan Area Optimization, IEEE TCAD, Vol. 11, No. 8, 1992, 992- 1002.

Google Scholar

[11]

K.H. Yeap and M. Sarrafzadeh, Sliceable Floorplanning by Graph Dualization, SIAM J. on Discrete Mathematics, May 1995.

Digital Library

Google Scholar

[12]

----, A Unified Approach to Floorplan Sizing and Enumeration, IEEE TCAD, Vol. 12, No. 12, 1993, pp. 1858-67.

Digital Library

Google Scholar

Cited By

View all

Yamanouchi TTamakashi KKambe TRutenbar ROtten R(1997)Hybrid floorplanning based on partial clustering and module restructuringProceedings of the 1996 IEEE/ACM international conference on Computer-aided design10.5555/244522.244863(478-483)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.5555/244522.244863
Dasgupta PSur-Kolay SKahng ASarrafzadeh M(1997)Slicibility of rectangular graphs and floorplan optimizationProceedings of the 1997 international symposium on Physical design10.1145/267665.267706(150-155)Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.1145/267665.267706

Index Terms

A unified approach to topology generation and area optimization of general floorplans

Recommendations

MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs

In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rates. Based on binary trees, the MP-tree is very efficient, effective, and ...
Deterministic VLSI block placement algorithm using less flexibility first principle

In this paper, a simple while effective deterministic algorithm for solving the VLSI block placement problem is proposed considering the packing area and interconnect wiring simultaneously. The algorithm is based on a principle inspired by observations ...
Optimization of placement solutions for routability
DAC '13: Proceedings of the 50th Annual Design Automation Conference

Routability has become a critical issue in VLSI design flow. To avoid producing an unroutable design, many placers [4-7] invoke global routers to get a congestion map and then move cells to reduce congestion based on this map. However, as cells move, ...

Comments

Information & Contributors

Information

Published In

ICCAD '95: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design

December 1995

748 pages

ISBN:0818672137

Chairman:
Richard Rudell
Synopsys, Inc., Mountain View, CA

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 December 1995

Check for updates

Author Tags

Qualifiers

Article

Conference

ICCAD '95

Sponsor:

SIGDA
IEEE-CS

ICCAD '95: International Conference on Computer Aided Design

November 5 - 9, 1995

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
508
Total Downloads

Downloads (Last 12 months)362
Downloads (Last 6 weeks)49

Reflects downloads up to 26 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yamanouchi TTamakashi KKambe TRutenbar ROtten R(1997)Hybrid floorplanning based on partial clustering and module restructuringProceedings of the 1996 IEEE/ACM international conference on Computer-aided design10.5555/244522.244863(478-483)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.5555/244522.244863
Dasgupta PSur-Kolay SKahng ASarrafzadeh M(1997)Slicibility of rectangular graphs and floorplan optimizationProceedings of the 1997 international symposium on Physical design10.1145/267665.267706(150-155)Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.1145/267665.267706

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs

Deterministic VLSI block placement algorithm using less flexibility first principle

Optimization of placement solutions for routability

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

MP-Trees: A Packing-Based Macro Placement Algorithm for Modern Mixed-Size Designs

Deterministic VLSI block placement algorithm using less flexibility first principle

Optimization of placement solutions for routability

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations