Ryan Kastner
ABSTRACT
In this wrok, we develop methods to reduce interconnect delay and noise caused by coupling. First, we explain the Coupling-Free Routing (CFR) problem. CFR takes a set of nets and tries to find a one-bend couple-free routing for a subset of nets. A routed net must not couple with any other routed net. We define coupling as a boolean variable which is true when the coupling of two nets is greater than some threshold. Any pair-wise coupling definition can be used. We argue that this problem is useful in both global and detailed routing
We develop an exact algorithm for the CFR decision problem via a transformation to 2-satisfiability. This algorithm runs in linear time. The decision problem determines whether the given set of nets is coupling-free routable. Next, we present the implication graph which models the dependencies associated with CFR. Also, we look at some of the properties associated with the graph.
Finally, we develop a new algorithm for the Maximum Coupling-Free Layout (MAX-CFL) problem. Given a set of nets, the MAX-CFL is defined as finding a subset of nets that are coupling-free routable. The subset should have maximum size and/or critically. The new algorithm, called implication algorithm, uses properties assoicated with the implication graph and experiments show that it consistently finds the best solution in terms of number of nets routed as compared to previous algorithms
- 1.A. Kahng, S. Mantik and D. Stroobandt. "Requirements for Models of Achievable Routing". In Proc. International Symposium on Physical Design, April 2000. Google Scholar
Digital Library
- 2.C. Alpert. "The ISPD98 Circuit Benchmark Suite". In Proc. International Symposium on Physical Design, April 1998. Google ScholarDigital Library
- 3.D. Sylvester et al. "Interconnect Scaling: Signal Integrity and Performance in Future High-speed CMOS Designs". In Proc. of VLSI Symposium on Technology, 1998.Google Scholar
- 4.J. Cong and D.Z. Pan. "Interconnect Delay Estimation Models for Synthesis and Design Planning". In Proc. Asia and South Pacific Design Automation Conference, January 1999.Google ScholarCross Ref
- 5.J. Cong et al. "Performance Optimization of VLSI Interconnect Layout". Integration, the VLSI Journal, 1996. Google ScholarDigital Library
- 6.K. Kozminski. "Benchmarks for Layout Synthesis - Evolution and Current Status". In Proc. ACM/IEEE Design Automation Conference, June 1991. Google ScholarDigital Library
- 7.K.F. Liao, M. Sarrafzadeh and C.K. Wong. "Single-Layer Global Routing". IEEE Transactions on Computer Aided Design, 1994.Google Scholar
- 8.M. Wang, X. Yang and M. Sarrafzadeh. "DRAGON: Fast Standard-Cell Placement for Large Circuits". In Proc. IEEE International Conference on Computer Aided Design, November 2000. Google ScholarDigital Library
- 9.R. Kastner, E. Borzorgzadeh and M. Sarrafzadeh. "Predictable Routing". In Proc. IEEE International Conference on Computer Aided Design, November 2000. Google ScholarDigital Library
- 10.R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh. "Coupling Aware Routing". In Proc. IEEE International ASIC/SOC Conference, September 2000.Google ScholarCross Ref
- 11.S. Even, A. Itai and A. Shamir. "On the Complexity of Timetable and Multicommodity Flow Problems". SIAM Journal of Comp., 1976.Google Scholar
- 12.V. Vaishnavi and D. Wood. "Rectilinear Line Segment Intersection, Layered Segment Trees and Dynamization". Journal of Algorithms, July 1982.Google Scholar
- 13.Z.-M. Lin and Z.-W. Ro. "A Heuristic Planar Routing Algorithm for High Performance Single-Layer Layout". Manuscript, 2000.Google Scholar
Index Terms
- An exact algorithm for coupling-free routing
Recommendations
A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing
ICCAD '12: Proceedings of the International Conference on Computer-Aided DesignConsidering routability issue in the early stages of VLSI design flow can avoid generating an unroutable design. Several recent routablity-driven placers [8--11] adopt a built-in global router to estimate routing congestion. While the routability of the ...
Obstacle-avoiding free-assignment routing for flip-chip designs
DAC '12: Proceedings of the 49th Annual Design Automation ConferenceThe flip-chip packaging is introduced for modern IC designs with higher integration density and larger I/O counts. It is necessary to consider routing obstacles for modern flip-chip designs, where the obstacles could be regions blocked for signal ...
A Multithreaded Initial Detailed Routing Algorithm Considering Global Routing Guides
2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)Detailed routing is the most complicated and time-consuming stage in VLSI design and has become a critical process for advanced node enablement. To handle the high complexity of modern detailed routing, initial detailed routing is often employed to ...
Comments