Article

Free access

New algorithm for over-the-cell channel routing using vacant terminals

Authors:

Nancy D. Holmes,

Naveed A. Sherwani,

Majid SarrafzadehAuthors Info & Claims

DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference

Pages 126 - 131

https://doi.org/10.1145/127601.127642

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

C. Chiang, M. Sarrafzadeh, and C. K. Wong, "A Global Router Based on Steiner Min-Max Trees," ICCAD-89, pp. 2-5.

Google Scholar

[2]

j. Cong, B. Preas, and C. L. Liu, "General Models and Algorithms for Over-the-Cell Routing in Standard Cell Design," Proc. 27lh A CM/IEEE Design Automation Conference, IEEE-90, pp. 709-715.

Digital Library

Google Scholar

[3]

J. Cong and C. L. Liu, "Over-the-Cell Channel Routing," Proc. International Conference on Computer-Aided Design, ICCAD-88, pp. 80-83.

Google Scholar

[4]

G. Gudmundsson and S. Ntafos, "Channel Routing with Supertermi'nals," Proc. 25th Allerton Conference on Computing, Control and Communication, 1987, pp. 375-376.

Google Scholar

[5]

N. Holmes, N. Sherwani, and M. Sarrafzadeh, "Utilization of Vacant Terminals for Improved Over-the-Cell Channel Routing," Technical Report #TR/91-03, Western Michigan Univ.

Google Scholar

[6]

It. E. Krohn, "An Over-the-Cell Gate Array Channel Router," 20th A CM/IEEE Design A utomalion Conference, IEEE-83, pp. 665-670.

Digital Library

Google Scholar

[7]

K.-W. Lee and C. Sechen, "A New Global Router for Row-Based Layout," Proceeding of IEEE International Conference on Computer-Aided Design, November 7-10, 1988, pp. 180-183.

Google Scholar

[8]

M. Sarrafzadeh and R. D. Lou, "Maximum Weighted K-Coverings in Transitive Graphs," Proc. 1990 IEEE Int. Syrup. on Circuits and Syst.

Google Scholar

[9]

N. A. Sherwani, "Graph Theoretic Approach to Single Row Routing Problems," Ph.D. Dissertation, Dept. of Computer Science, Univ. of Nebraska-Lincoln, August 1988.

Digital Library

Google Scholar

[10]

T. G. Szymanski, "Dogleg Channel Routing is NP- Complete," IEEE Trans. on Computer Aided Design, 1985, Vol. CAD-4, pp. 31-41.

Google Scholar

Cited By

View all

Danda SLiu XMadhwapathy SPanyam ASherwani NTollis I(2006)Optimal algorithms for planar over-the-cell routing problemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.54376915:11(1365-1378)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.543769
Wang TWong DSun YWong C(2006)Optimal net assignmentIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.37042014:2(265-269)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.370420
Terai MNakajima KTakahashi KSato K(2006)A new approach to over-the-cell channel routing with three layersIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.25994213:2(187-200)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.259942
Show More Cited By

Index Terms

New algorithm for over-the-cell channel routing using vacant terminals

Recommendations

Utilization of vacant terminals for improved over-the-cell channel routing

The WISER algorithm for over-the-cell channel routing in the standard cell design style using the two-layer routing model is presented. The novelty of this approach lies in the use of vacant terminals for over-the-cell routing. Longest paths in the ...
New approaches to standard cell placement and routing
On over-the-cell channel routing with cell orientations consideration

Existing over-the-cell channel routers assume that the orientations of the cells are fixed. In practice, it is quite common that each cell can be horizontally flipped. This pin rearrangement flexibility should be used by over-the-cell routers to further ...

Comments

Information & Contributors

Information

Published In

DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference

June 1991

783 pages

ISBN:0897913957

DOI:10.1145/127601

Chairman:
A. Richard Newton
Univ. of California, Berkeley

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC91

Sponsor:

SIGDA
IEEE-CS

DAC91: The 28th ACM/IEEE Design Automation Conference

June 17 - 22, 1991

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
214
Total Downloads

Downloads (Last 12 months)47
Downloads (Last 6 weeks)13

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Danda SLiu XMadhwapathy SPanyam ASherwani NTollis I(2006)Optimal algorithms for planar over-the-cell routing problemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.54376915:11(1365-1378)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.543769
Wang TWong DSun YWong C(2006)Optimal net assignmentIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.37042014:2(265-269)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.370420
Terai MNakajima KTakahashi KSato K(2006)A new approach to over-the-cell channel routing with three layersIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.25994213:2(187-200)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.259942
Chang LHsiao PYan JShew P(2006)A robust over-the-cell channel routerIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.25693412:10(1592-1599)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.256934
Cong JHossain MSherwani N(2006)A provably good multilayer topological planar routing algorithm in IC layout designsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.18484412:1(70-78)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.184844
Ting-Chi Wang Shui-An Wen Wong DWong C(1998)A new approach to over-the-cell channel routingISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187)10.1109/ISCAS.1998.705258(248-253)Online publication date: 1998
https://doi.org/10.1109/ISCAS.1998.705258
Ting-Chi Wang Wong DWong C(1997)A new channel pin assignment algorithm and its application to over-the-cell routingProceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '9710.1109/ISCAS.1997.621427(1560-1563)Online publication date: 1997
https://doi.org/10.1109/ISCAS.1997.621427
Shew PJong-Shen Shei Pei-Yuug Hsiao (1995)A constrained terminals over-the-cell router1995 IEEE TENCON. IEEE Region 10 International Conference on Microelectronics and VLSI. 'Asia-Pacific Microelectronics 2000'. Proceedings10.1109/TENCON.1995.496364(167-170)Online publication date: 1995
https://doi.org/10.1109/TENCON.1995.496364
Danda SMadhwapathy SSherwani NSureka A(1995)OPRON: a new approach to planar OTC routingProceedings. Fifth Great Lakes Symposium on VLSI10.1109/GLSV.1995.516054(208-211)Online publication date: 1995
https://doi.org/10.1109/GLSV.1995.516054
Koide TSuzuki TWakabayashi SYoshida N(1995)A standard cell global routing algorithm with net selection for over-the-cell routingElectronics and Communications in Japan (Part III: Fundamental Electronic Science)10.1002/ecjc.443078121178:12(102-115)Online publication date: Dec-1995
https://doi.org/10.1002/ecjc.4430781211
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Utilization of vacant terminals for improved over-the-cell channel routing

New approaches to standard cell placement and routing

On over-the-cell channel routing with cell orientations consideration

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Utilization of vacant terminals for improved over-the-cell channel routing

New approaches to standard cell placement and routing

On over-the-cell channel routing with cell orientations consideration

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations