Congestion reduction during placement with provably good approximation bound

Authors:
X. Yang;M. Wang;R. Kastner;S. Ghiasi;M. Sarrafzadeh
Affiliations:
Synplicity, Inc., Sunnyvale, CA;Cadence Design Systems, Inc., San Jose, CA;University of California, Santa Barbara, CA;University of California, Los Angeles, CA;University of California, Los Angeles, CA
Venue:
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Year:
2003

Citing 12
Cited 4

RISA: accurate and efficient placement routability modeling

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Congestion driven quadratic placement

DAC '98 Proceedings of the 35th annual Design Automation Conference
Performance driven multi-layer general area routing for PCB/MCM designs

DAC '98 Proceedings of the 35th annual Design Automation Conference
Requirements for models of achievable routing

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Multi-center congestion estimation and minimization during placement

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Can recursive bisection alone produce routable placements?

Proceedings of the 37th Annual Design Automation Conference
Estimating routing congestion using probabilistic analysis

Proceedings of the 2001 international symposium on Physical design
Congestion estimation during top-down placement

Proceedings of the 2001 international symposium on Physical design
Dragon2000: standard-cell placement tool for large industry circuits

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Congestion minimization during placement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
GORDIAN: VLSI placement by quadratic programming and slicing optimization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient and effective placement for very large circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Prediction and reduction of routing congestion

Proceedings of the 2006 international symposium on Physical design
Evaluation, prediction and reduction of routing congestion

Microelectronics Journal
CELONCEL: effective design technique for 3-D monolithic integration targeting high performance integrated circuits

Proceedings of the 16th Asia and South Pacific Design Automation Conference
Cell transformations and physical design techniques for 3D monolithic integrated circuits

ACM Journal on Emerging Technologies in Computing Systems (JETC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel method to reduce routing congestion during placement stage. The proposed approach is used as a post-processing step in placement. Congestion reduction is based on local improvement on the existing layout. However, the approach has a global view of the congestion over the entire design. It uses integer linear programming (ILP) to formulate the problem of conflicts between multiple congested regions, and performs local improvement according to the solution of the ILP problem. The approximation algorithm of the formulated ILP problem is studied and good approximation bounds are given and proved. Experiments show that the proposed approach can effectively alleviate the congestion of global routing results. The low computational complexity of the proposed approach indicates its scalability on large designs.