NDLI: Porosity-aware buffered Steiner tree construction

Content Provider	IEEE Xplore Digital Library
Author	Alpert, C.J. Gandham, G. Hrkic, M. Jiang Hu Quay, S.T. Sze, C.N.
Copyright Year	1982
Abstract	In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis system. Modern designs may contain large blocks which severely constrain the buffer locations. Even when there may appear to be space for buffers in the alleys between large blocks, these regions are often densely packed or may be needed later to fix critical paths. Therefore, within physical synthesis, a buffer insertion scheme needs to be aware of the porosity of the existing layout to be able to decide when to insert buffers in dense regions to achieve critical performance improvement and when to utilize the sparser regions of the chip. This work addresses the problem of finding porosity-aware buffering solutions by constructing a "smart Steiner tree" to pass to van Ginneken's topology-based algorithm. This flow allows one to fully integrate the algorithm into a physical synthesis system without paying an exorbitant runtime penalty. We show that significant improvements on timing closure are obtained when this approach is integrated into a physical synthesis system.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	517
Ending Page	526
Page Count	10
File Size	792063
File Format	PDF
ISSN	02780070
Volume Number	23
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-04-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Integrated circuit interconnections Very large scale integration Topology Timing Integrated circuit synthesis Steiner trees Runtime Circuit synthesis Integrated circuit technology Dynamic programming
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A place and route aware buffered Steiner tree construction

Hierarchical buffered routing tree generation

FastRoute: A Step to Integrate Global Routing into Placement

Spanning graph-based nonrectilinear steiner tree algorithms

Non-Hanan routing

Porosity-aware Buffered Steiner Tree Construction (2004)

An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations

Optimal wiresizing under Elmore delay model

Utilizing Redundancy for Timing Critical Interconnect

Porosity-aware buffered Steiner tree construction

Similar Documents

A place and route aware buffered Steiner tree construction

Hierarchical buffered routing tree generation

FastRoute: A Step to Integrate Global Routing into Placement

Spanning graph-based nonrectilinear steiner tree algorithms

Non-Hanan routing

Porosity-aware Buffered Steiner Tree Construction (2004)

An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations

Optimal wiresizing under Elmore delay model

Utilizing Redundancy for Timing Critical Interconnect

Porosity-aware buffered Steiner tree construction