A fixed-die floorplanning algorithm using an analytical approach

Yong Zhan; Yan Feng; Sachin S. Sapatnekar

doi:10.1145/1118299.1118477

A fixed-die floorplanning algorithm using an analytical approach

Yong Zhan, Yan Feng, Sachin S. Sapatnekar

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

29 Scopus citations

Abstract

Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the timeto-market of the design. In this paper, we present an analytical floorplanning algorithm that can be used to efficiently pack soft modules into a fixed die. The locations and sizing of the modules are simultaneously optimized so that a minimum total wire length is achieved. Experiments on the MCNC and GSRC benchmarks show that our algorithm can achieve above a 90% success rate with a 10% white space constraint in the fixed die, and the efficiency is much higher than that of the simulated annealing based algorithms for benchmarks containing a large number of modules.

Original language	English (US)
Title of host publication	Proceedings of the ASP-DAC 2006
Subtitle of host publication	Asia and South Pacific Design Automation Conference 2006
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	771-776
Number of pages	6
ISBN (Print)	0780394518, 9780780394513
DOIs	https://doi.org/10.1145/1118299.1118477
State	Published - 2006
Event	ASP-DAC 2006: Asia and South Pacific Design Automation Conference 2006 - Yokohama, Japan Duration: Jan 24 2006 → Jan 27 2006

Publication series

Name	Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Volume	2006

Other

Other	ASP-DAC 2006: Asia and South Pacific Design Automation Conference 2006
Country/Territory	Japan
City	Yokohama
Period	1/24/06 → 1/27/06

Access

10.1145/1118299.1118477

OpenUrl availability

Full text

Cite this

Zhan, Y., Feng, Y., & Sapatnekar, S. S. (2006). A fixed-die floorplanning algorithm using an analytical approach. In Proceedings of the ASP-DAC 2006: Asia and South Pacific Design Automation Conference 2006 (pp. 771-776). Article 1594779 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC; Vol. 2006). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1145/1118299.1118477

A fixed-die floorplanning algorithm using an analytical approach. / Zhan, Yong; Feng, Yan; Sapatnekar, Sachin S.
Proceedings of the ASP-DAC 2006: Asia and South Pacific Design Automation Conference 2006. Institute of Electrical and Electronics Engineers Inc., 2006. p. 771-776 1594779 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC; Vol. 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zhan, Y, Feng, Y & Sapatnekar, SS 2006, A fixed-die floorplanning algorithm using an analytical approach. in Proceedings of the ASP-DAC 2006: Asia and South Pacific Design Automation Conference 2006., 1594779, Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, vol. 2006, Institute of Electrical and Electronics Engineers Inc., pp. 771-776, ASP-DAC 2006: Asia and South Pacific Design Automation Conference 2006, Yokohama, Japan, 1/24/06. https://doi.org/10.1145/1118299.1118477

Zhan Y, Feng Y, Sapatnekar SS. A fixed-die floorplanning algorithm using an analytical approach. In Proceedings of the ASP-DAC 2006: Asia and South Pacific Design Automation Conference 2006. Institute of Electrical and Electronics Engineers Inc. 2006. p. 771-776. 1594779. (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC). doi: 10.1145/1118299.1118477

@inproceedings{1655722e905a48e79f3ef054e1222a7e,

title = "A fixed-die floorplanning algorithm using an analytical approach",

abstract = "Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the timeto-market of the design. In this paper, we present an analytical floorplanning algorithm that can be used to efficiently pack soft modules into a fixed die. The locations and sizing of the modules are simultaneously optimized so that a minimum total wire length is achieved. Experiments on the MCNC and GSRC benchmarks show that our algorithm can achieve above a 90% success rate with a 10% white space constraint in the fixed die, and the efficiency is much higher than that of the simulated annealing based algorithms for benchmarks containing a large number of modules.",

author = "Yong Zhan and Yan Feng and Sapatnekar, {Sachin S.}",

year = "2006",

doi = "10.1145/1118299.1118477",

language = "English (US)",

isbn = "0780394518",

series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "771--776",

booktitle = "Proceedings of the ASP-DAC 2006",

}

TY - GEN

T1 - A fixed-die floorplanning algorithm using an analytical approach

AU - Zhan, Yong

AU - Feng, Yan

AU - Sapatnekar, Sachin S.

PY - 2006

Y1 - 2006

N2 - Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the timeto-market of the design. In this paper, we present an analytical floorplanning algorithm that can be used to efficiently pack soft modules into a fixed die. The locations and sizing of the modules are simultaneously optimized so that a minimum total wire length is achieved. Experiments on the MCNC and GSRC benchmarks show that our algorithm can achieve above a 90% success rate with a 10% white space constraint in the fixed die, and the efficiency is much higher than that of the simulated annealing based algorithms for benchmarks containing a large number of modules.

AB - Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the timeto-market of the design. In this paper, we present an analytical floorplanning algorithm that can be used to efficiently pack soft modules into a fixed die. The locations and sizing of the modules are simultaneously optimized so that a minimum total wire length is achieved. Experiments on the MCNC and GSRC benchmarks show that our algorithm can achieve above a 90% success rate with a 10% white space constraint in the fixed die, and the efficiency is much higher than that of the simulated annealing based algorithms for benchmarks containing a large number of modules.

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

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

U2 - 10.1145/1118299.1118477

DO - 10.1145/1118299.1118477

M3 - Conference contribution

AN - SCOPUS:33748595788

SN - 0780394518

SN - 9780780394513

T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

SP - 771

EP - 776

BT - Proceedings of the ASP-DAC 2006

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - ASP-DAC 2006: Asia and South Pacific Design Automation Conference 2006

Y2 - 24 January 2006 through 27 January 2006

ER -

A fixed-die floorplanning algorithm using an analytical approach

Abstract

Publication series

Other

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this