An escape routing framework for dense boards with high-speed design constraints

Muhammet Mustafa Ozdal; Martin D. F. Wong; Philip S. Honsinger

doi:10.1109/ICCAD.2005.1560166

An escape routing framework for dense boards with high-speed design constraints

Muhammet Mustafa Ozdal, Martin D. F. Wong, Philip S. Honsinger

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

15 Citations (Scopus)

Abstract

Shrinking transistor sizes, increasing circuit complexities, and high clock frequencies bring new board routing challenges that cannot be handled effectively by traditional routing algorithms. Many high-end designs in the industry today require manual routing efforts, which increases the design cycle times considerably. In this paper, we propose an escape routing algorithm to route nets within multiple dense components simultaneously so that the number of crossings in the intermediate area is minimized. We also show how to handle high-speed design constraints within the framework of this algorithm. Experimental comparisons with a recently proposed algorithm (Ozdal and Wong, 2004) show that our algorithm reduces the via requirements of industrial test cases on average by 39%.

Original language	English
Title of host publication	Proceedings of the 2005 International Conference on Computer-Aided Design
Place of Publication	United States
Publisher	IEEE
Pages	758-765
Number of pages	8
ISBN (Print)	078039254X, 9780780392540
DOIs	https://doi.org/10.1109/ICCAD.2005.1560166
Publication status	Published - Nov 2005
Event	IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2005 - San Jose, United States Duration: 6 Nov 2005 → 10 Nov 2005 https://ieeexplore.ieee.org/xpl/conhome/10431/proceeding (Conference proceedings)

Publication series

Name	IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
Volume	2005
ISSN (Print)	1092-3152
ISSN (Electronic)	1558-2434

Conference

Conference	IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2005
Country/Territory	United States
City	San Jose
Period	6/11/05 → 10/11/05
Internet address	https://ieeexplore.ieee.org/xpl/conhome/10431/proceeding (Conference proceedings)

Scopus Subject Areas

Software
Computer Science Applications
Computer Graphics and Computer-Aided Design

Access to Document

10.1109/ICCAD.2005.1560166

Cite this

Ozdal, M. M., Wong, M. D. F., & Honsinger, P. S. (2005). An escape routing framework for dense boards with high-speed design constraints. In Proceedings of the 2005 International Conference on Computer-Aided Design (pp. 758-765). (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD; Vol. 2005). IEEE. https://doi.org/10.1109/ICCAD.2005.1560166

@inproceedings{06af7e1e3e5346ac96b8f6217f81d67b,

title = "An escape routing framework for dense boards with high-speed design constraints",

abstract = "Shrinking transistor sizes, increasing circuit complexities, and high clock frequencies bring new board routing challenges that cannot be handled effectively by traditional routing algorithms. Many high-end designs in the industry today require manual routing efforts, which increases the design cycle times considerably. In this paper, we propose an escape routing algorithm to route nets within multiple dense components simultaneously so that the number of crossings in the intermediate area is minimized. We also show how to handle high-speed design constraints within the framework of this algorithm. Experimental comparisons with a recently proposed algorithm (Ozdal and Wong, 2004) show that our algorithm reduces the via requirements of industrial test cases on average by 39%.",

author = "Ozdal, {Muhammet Mustafa} and Wong, {Martin D. F.} and Honsinger, {Philip S.}",

note = "Funding information: This work was partially supported by the National Science Foundation under grant CCR-0306244 and by an IBM Faculty Award. Publisher copyright: {\textcopyright}2005 IEEE.; IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2005 ; Conference date: 06-11-2005 Through 10-11-2005",

year = "2005",

month = nov,

doi = "10.1109/ICCAD.2005.1560166",

language = "English",

isbn = "078039254X",

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

publisher = "IEEE",

pages = "758--765",

booktitle = "Proceedings of the 2005 International Conference on Computer-Aided Design",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/10431/proceeding",

}

Ozdal, MM, Wong, MDF & Honsinger, PS 2005, An escape routing framework for dense boards with high-speed design constraints. in Proceedings of the 2005 International Conference on Computer-Aided Design. IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, vol. 2005, IEEE, United States, pp. 758-765, IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2005, San Jose, California, United States, 6/11/05. https://doi.org/10.1109/ICCAD.2005.1560166

An escape routing framework for dense boards with high-speed design constraints. / Ozdal, Muhammet Mustafa; Wong, Martin D. F.; Honsinger, Philip S.
Proceedings of the 2005 International Conference on Computer-Aided Design. United States: IEEE, 2005. p. 758-765 (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD; Vol. 2005).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - An escape routing framework for dense boards with high-speed design constraints

AU - Ozdal, Muhammet Mustafa

AU - Wong, Martin D. F.

AU - Honsinger, Philip S.

PY - 2005/11

Y1 - 2005/11

N2 - Shrinking transistor sizes, increasing circuit complexities, and high clock frequencies bring new board routing challenges that cannot be handled effectively by traditional routing algorithms. Many high-end designs in the industry today require manual routing efforts, which increases the design cycle times considerably. In this paper, we propose an escape routing algorithm to route nets within multiple dense components simultaneously so that the number of crossings in the intermediate area is minimized. We also show how to handle high-speed design constraints within the framework of this algorithm. Experimental comparisons with a recently proposed algorithm (Ozdal and Wong, 2004) show that our algorithm reduces the via requirements of industrial test cases on average by 39%.

AB - Shrinking transistor sizes, increasing circuit complexities, and high clock frequencies bring new board routing challenges that cannot be handled effectively by traditional routing algorithms. Many high-end designs in the industry today require manual routing efforts, which increases the design cycle times considerably. In this paper, we propose an escape routing algorithm to route nets within multiple dense components simultaneously so that the number of crossings in the intermediate area is minimized. We also show how to handle high-speed design constraints within the framework of this algorithm. Experimental comparisons with a recently proposed algorithm (Ozdal and Wong, 2004) show that our algorithm reduces the via requirements of industrial test cases on average by 39%.

UR - http://www.scopus.com/inward/record.url?scp=33751402624&partnerID=8YFLogxK

U2 - 10.1109/ICCAD.2005.1560166

DO - 10.1109/ICCAD.2005.1560166

M3 - Conference proceeding

AN - SCOPUS:33751402624

SN - 078039254X

SN - 9780780392540

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

SP - 758

EP - 765

BT - Proceedings of the 2005 International Conference on Computer-Aided Design

PB - IEEE

CY - United States

T2 - IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2005

Y2 - 6 November 2005 through 10 November 2005

ER -

An escape routing framework for dense boards with high-speed design constraints

Abstract

Publication series

Conference

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this