Congestion reduction during placement with provably good approximation bound-Reference-Cited by-同舟云学术

Congestion reduction during placement with provably good approximation bound

Published:2003-07 Issue:3 Volume:8 Page:316-333
ISSN:1084-4309
Container-title:ACM Transactions on Design Automation of Electronic Systems
language:en
Short-container-title:ACM Trans. Des. Autom. Electron. Syst.

Author:

Yang X.¹,Wang M.²,Kastner R.³,Ghiasi S.⁴,Sarrafzadeh M.⁴

Affiliation:

1. Synplicity, Inc., Sunnyvale, CA

2. Cadence Design Systems, Inc., San Jose, CA

3. University of California, Santa Barbara, CA

4. University of California, Los Angeles, CA

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications

Link

https://dl.acm.org/doi/pdf/10.1145/785411.785414

Reference17 articles.

1. Caldwell A. E. Kahng A. B. and Markov I. L. 2000. "Can Recursive Bisection Alone Produce Routable Placements?" In Design Automation Conference pages 477--482. 10.1145/337292.337549 Caldwell A. E. Kahng A. B. and Markov I. L. 2000. "Can Recursive Bisection Alone Produce Routable Placements?" In Design Automation Conference pages 477--482. 10.1145/337292.337549

2. Cong J. and Madden P. 1998. "Performance Driven Multi-Layer General Area Routing for PCB/MCM Designs." In Design Automation Conference pages 356--361. 10.1145/277044.277144 Cong J. and Madden P. 1998. "Performance Driven Multi-Layer General Area Routing for PCB/MCM Designs." In Design Automation Conference pages 356--361. 10.1145/277044.277144

3. A Procedure for Placement of Standard Cell VLSI Circuits;Dunlop A. E.;IEEE Trans. Comput. Aided Design,1985

4. ERLAB(a). "IBM-PLACE benchmark." http://er.cs.ucla.edu/benchmarks/ibm-place/. ERLAB(a). "IBM-PLACE benchmark." http://er.cs.ucla.edu/benchmarks/ibm-place/.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Power Converter Circuit Design Automation Using Parallel Monte Carlo Tree Search;ACM Transactions on Design Automation of Electronic Systems;2022-12-24

2. Cell transformations and physical design techniques for 3D monolithic integrated circuits;ACM Journal on Emerging Technologies in Computing Systems;2013-09

3. ReCoNodes—Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices;Dynamically Reconfigurable Systems;2010

4. Evaluation, prediction and reduction of routing congestion;Microelectronics Journal;2007-08

5. Minimum-Congestion Placement for Y-interconnects: Some studies and observations;IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07);2007