Browse > Article

Improved Global Placement Technique to Relieve Routing Congestion  

Oh, Eun-Kyung (동아대학교 컴퓨터공학과)
Hur, Sung-Woo (동아대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.14, no.4, 2008 , pp. 431-435 More about this Journal
Abstract
Since previous work CDP(Congestion Driven Placement) [1] considers all possible directions to move every cell in nets which contribute highly to routing congestion, it consumes CPU time a lot. In this paper, we propose a faster global placement technique, so called ICDGP(Improved Congestion Driven Global Placement) to relieve the routing congestion. ICDGP uses the force-directed method to determine the target locations of the cells in the nets in the congested spots, and considers only to move the target location for each cell. If moving multiple cells simultaneously is considered better than moving each cell one by one it moves multiple cells simultaneously. By experimental results, ICDGP produces less congested placement than CDP does. Particularly, the CPU time is reduced by 36% on average.
Keywords
routing congestion; global placement; force-directed method;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 A. E. Caldwell, A. B. Kahng, and I.L. Markov, "Can Recursive Bisection Alone Produce Routable Placements?," Proc. of DAC, pp. 477-482, 2000
2 M.C.Yildiz and P.H.Madden "Improved Cut Sequences for Partitioning Based Placement," Proc. of DAC, pp. 776-729, 2001
3 A.B.Kahng and S. Reda, "Wirelength Minimization for Min-Cut Placements via Placement Feedback," IEEE Trans. on CAD of Integrated Circuits and Systems, Vol.25, No.7, pp. 1301-1312, 2006   DOI   ScienceOn
4 S. Hur and J. Lillis, "Mongrel: Hybrid Techniques for Standard Cell Placement," Proc. of ICCAD, pp. 165-170, 2000
5 X. Yang, B-K. Choi, and M. Sarrafzadeh, "Routability Driven White Space Allocation for Fixed- die Standard Cell Placement," Proc. of ISPD, pp. 42-50, 2002
6 H. Eisenmann and F. M. Johannes, "Generic Global Placement and Floorplanning," Proc. of DAC, pp. 269-274, 1998
7 A. Agnihotri, et al. "Fractional Cut: Improved Recursive Bisection Placement," Proc. of ICCAD, pp. 307-310, 2003
8 Wern-Jieh and Carl Sechen, "Efficient and Effective Placement for Very Large Circuits," IEEE Trans. on CAD of Integrated Circuits and Systems, pp. 349-359, 1995
9 X. Yang, M. Wang, K. Egur and M. Sarrafzadeh, "A Snap-on Placement Tool," Proc. of ISPD, pp. 153-158, 2000
10 G. Meixner and U. Lauther, "Congestion-Driven Placement Using a New Multi-Partitioning Heuristic," Porc. of ICCAD, pp. 332-335, 1990
11 오은경, 허성우, "배선밀집도 드리븐 배치", 한국정보처리학회 논문지, 제13-A권, 제1호, pp. 57-70, 2006   과학기술학회마을   DOI