NDLI: Congestion-Driven Placement Improvement Using Cell Spreading

Content Provider	IEEE Xplore Digital Library
Author	Ling Yang Qiang Zhou Xianlong Hong
Copyright Year	2006
Description	Author affiliation: Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing (Ling Yang; Qiang Zhou; Xianlong Hong)
Abstract	As technology moves into VDSM arena, the integration density of ICs goes higher and higher. It makes the congestion a global issue, for it appears in many pieces on the chip while not only in some bins. Many methods proposed before just focused on reducing the congestion restrictedly in one bin, but can not handle the problem of global congestion effectively. In this paper, a congestion-driven placement method using cell spreading is proposed, which alters the routing supply and the routing demand by row or column uniformly. During the spreading process, cells move along the direction in which the congestion is cut down. The average routing demands are set to control the extent for cell spreading to avoid producing new congestion. The experiments show that our method can reduce the congestion by 31.4% in x direction and 22.1% in y direction on average while within 5% wire length being increased
Sponsorship	IEEE Circuits and Syst. Soc. HKUST UESTC City Univ. of Hong Kong
Starting Page	2415
Ending Page	2419
File Size	6350958
Page Count	5
File Format	PDF
ISBN	0780395840
DOI	10.1109/ICCCAS.2006.285164
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-06-25
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science Very large scale integration Routing Topology Timing Partitioning algorithms Performance analysis Wire Quadratic programming Design optimization
Content Type	Text
Resource Type	Article

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 path-based timing-driven quadratic placement algorithm

Congestion driven quadratic placement

Congestion driven incremental placement algorithm for standard cell layout

Congestion driven incremental placement algorithm based on network flow

Interconnection driven VLSI module placement based on quadratic programming and considering congestion using LFF principles

A new timing-driven standard cell placement algorithm

Timing-driven bipartitioning with replication using iterative quadratic programming

Early wirability checking and 2D congestion-driven circuit placement

A timing-driven macro-cell placement algorithm

Congestion-Driven Placement Improvement Using Cell Spreading

Similar Documents

A path-based timing-driven quadratic placement algorithm

Congestion driven quadratic placement

Congestion driven incremental placement algorithm for standard cell layout

Congestion driven incremental placement algorithm based on network flow

Interconnection driven VLSI module placement based on quadratic programming and considering congestion using LFF principles

A new timing-driven standard cell placement algorithm

Timing-driven bipartitioning with replication using iterative quadratic programming

Early wirability checking and 2D congestion-driven circuit placement

A timing-driven macro-cell placement algorithm

Congestion-Driven Placement Improvement Using Cell Spreading