Congestion Estimation for 3D Routing

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Lerong Cheng Articles by William N. N. Hung Articles by Guowu Yang Articles by Xiaoyu Song

IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design (ISVLSI'04)

Congestion Estimation for 3D Routing (PDF)

Lafayette, Louisiana

February 19-February 20

ISBN: 0-7695-2097-9

	ASCII Text	x
	Lerong Cheng, William N. N. Hung, Guowu Yang, Xiaoyu Song, "Congestion Estimation for 3D Routing," VLSI, IEEE Computer Society Annual Symposium on, pp. 239, IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design (ISVLSI'04), 2004.

	BibTex	x
	@article{ 10.1109/ISVLSI.2004.1339541, author = {Lerong Cheng and William N. N. Hung and Guowu Yang and Xiaoyu Song}, title = {Congestion Estimation for 3D Routing}, journal ={VLSI, IEEE Computer Society Annual Symposium on}, volume = {0}, year = {2004}, isbn = {0-7695-2097-9}, pages = {239}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISVLSI.2004.1339541}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - VLSI, IEEE Computer Society Annual Symposium on TI - Congestion Estimation for 3D Routing SN - 0-7695-2097-9 SP EP A1 - Lerong Cheng, A1 - William N. N. Hung, A1 - Guowu Yang, A1 - Xiaoyu Song, PY - 2004 KW - null VL - 0 JA - VLSI, IEEE Computer Society Annual Symposium on ER -

Lerong Cheng, Portland State University

William N. N. Hung, Portland State University

Guowu Yang, Portland State University

Xiaoyu Song, Portland State University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVLSI.2004.1339541

Three-dimensional (3D) routing is an important step in deep sub-micron VLSI design. Given a 3D grid graph and a set of two-terminal nets to be routed, we propose a probabilistic model to calculate the routing density (congestion) on each edge of the grid graph. The routing density provides a direct congestion estimation. Our experimental results demonstrate the effectiveness of the method on routing benchmarks.

Citation:

Lerong Cheng, William N. N. Hung, Guowu Yang, Xiaoyu Song, "Congestion Estimation for 3D Routing," isvlsi, pp.239, IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design (ISVLSI'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.