Probabilistic estimation for routing space

Computer Journal

Volumn 48, Issue 6, 2005, Pages 667-676

  He, Fei ^a   Gu, Ming ^a   Song, Xiaoyu ^b   Tang, Zhiwei ^b   Yang, Guowu ^b   Cheng, Lerong ^c  

^a TSINGHUA UNIVERSITY   (China)

^b Portland State University   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ARRAYS; AUTOMATION; ESTIMATION; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; THEOREM PROVING; VLSI CIRCUITS;

PROBABILISTIC ESTIMATION; ROUTING CONGESTION; ROUTING SPACE;

ROUTERS;

EID: 27844441838     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxh104     Document Type: Article

References (12)

1. Sutherland, N. and Oesticher, N. (1973) How big should a printed circuit board be? IEEE Trans. Comput., C-22, 537-741.
2. Gamal, A. (1981) Two-dimensional stochastic model for interconnections in master slice integrated circuits. IEEE Trans. Circuits Syst., CAS I-28 (2), 127-138.
3. Gamal, A. and Syed, Z. (1981) A stochastic model for interconnections in custom integrated circuits. IEEE Trans. Circuits Syst., CAS I-28, 888-894.
4. Kurdahi, F. and Parker, A. (1986) Techniques for area estimation of VLSI layouts. IEEE Trans. Comput. Aid. D., 8(1), 81.
5. Heller, W., Mikhail, W. and Donath, W. (1980) Prediction of wiring space requirements of LSI. J. Des. Autom. Fault, 2 (2),117-144.
6. Song, X., Tang, Q., Zhou, D. and Wang, Y. (2000) Wire space estimation and routability analysis. IEEE Trans. Comput. Aid. D., 19(5), 624-628.
7. Cho, J. (2000) Wiring space and length estimation in two-dimensional arrays. IEEE Trans. Comput. Aid. D., 19(5), 612-615.
8. Lou, J., Thakur, S., Krishnamoorthy, S. and Sheng, H. (2002) Estimating routing congestion using probabilistic analysis. IEEE Trans. Comput. Aid. D., 21(1), 32-41.
9. Cheng, L., Song, X., Yang, G. and Tang, Z. (2004) A fast congestion estimator for routing with bounded detours. In Proc. ASP-DAC 2004, Yokohama, Japan, January 27-30, pp. 666-670. IEEE, USA.
10. Cheng, L., Hung, W., Yang, G. and Song, X. (2004) Congestion Estimation for 3D Routing. In Proc. ISVLSI 2004, Lafayette, LA, February 19-20, pp. 239-240. IEEE Computer Society, USA.
11. Burstein, M. and Pelavin, R. (1983) Hierarchical wire routing. IEEE Trans. Comput. Aid. D., 2(4), 223-234.
12. UCLA, http://www.ece.ucsb.edu/~kastner/labyrinth/.