GRPlacer: Improving routability and wire-length of global routing with circuit replacement

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2009, Pages 351-356

  Dai, Ke Ren ^a   Lu, Chien Hung ^b   Li, Yih Lang ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b SpringSoft Inc   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE MATCHINGS; CELL SORTING; CONGESTION REDUCTION; GLOBAL ROUTING; LOWER BOUNDS; PHYSICAL DESIGN; PLACEMENT AND ROUTING; ROUTABILITY; WIRE LENGTH; WIRE LENGTH ESTIMATION;

COMPUTER AIDED DESIGN; MOBILE TELECOMMUNICATION SYSTEMS; WIRE;

TRAFFIC CONGESTION;

EID: 76349116045     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. J. A. Roy, J. F. Lu, and I. L. Markov. "Seeing the Forest and the Trees: Steiner Wirelength Optimization in placement," IEEE Trans. on Computer-Aided Design, vol. 26 no. 4, pp. 632-644, April 2007
2. M. Pan and Chris Chu. "IPR: an integrated placement and routing algorithm," In Proc. Design Automation Conf., pp. 59-62, 2007.
3. C. Li, M. Xie, C.-K. Koh, J. Cong, and P. H. Madden, "Routability- driven placement and white space allocation," In Proc. IEEE/ACM Intl. Conf. Computer-Aided Design, 2004, pp. 394-401.
4. P. Spindler and F. M. Johannes. "Fast and accurate routing demand estimation for efficient routability-driven placement," In Proc. of DATE, pp. 1226-1231, Nice, France, 2007.
5. Z.-W. Jiang, B.-Y. Su, and Y.-W. Chang . "Routability-driven analytical placement by net overlapping removal for large-scale mixed-size designs," In Proc. Design Automation Conf., pp. 167-172, 2008.
6. K.-R. Dai, W.-H. Liu, and Y.-L. Li, "Efficient Simulated Evolution Based Rerouting and Congestion-Relaxed Layer Assignment on 3-D Global Routing", in Proc. Asia and South Pacific Design Automation Conf, 2009
7. S. Goto. "An Efficient Algorithm for the Two-Dimensional Placement Problem in Electrical Circuit Layout," In IEEE Transitions on Circuits and Systems, Vol. CAS-28, No. 1, pp. 12-18, 1981.
8. M. Pan, N. Viswanathan and Chris Chu. "An Efficient and Effective Detailed Placement Algorithm," In Proc. IEEE/ACM Intl. Conf. Computer-Aided Design, pp. 48-55, 2005.
9. 1- approximation, " In BIT 30, pp 301-310, 1990
10. M. Pan and Chris Chu, "FastRoute: A Step to integrate global routing in placement", In Proc. IEEE/ACM Intl. Conf. Computer-Aided Design, pp. 464-471, 2006.
11. Peter Spindler, Ulf Schlichtmann, and Frank M. Johannes. "Abacus: fast legalization of standard cell circuits with minimal movement," In Proc. Intl. Symp. On Physical Desgin, pp. 47-53, 2008.
12. R. Kastner, E. Bozorgzadeh and M. Sarrafzadeh, "Pattern routing: use and theory for increasing predictability and avoiding coupling," IEEE Trans. On Computer-Aided Design of Integrated Circuits and Systems, pages 777-790, July 2002.
13. X. Yang, B.-K. Choi, and M. Sarrafzadeh. "Routabilitydriven white space allocation for fixed-die standard-cell placement," In Proc. Intl. Symp. On Physical Desgin 2002.