Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/800139.804535acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
Article
Free access

A fast maze router with iterative use of variable search space restriction

Published: 23 June 1980 Publication History

Abstract

This paper describes a new method of restricting search space for maze routing, to achieve a higher routing completion ratio and shorter machine time. The router is applied iteratively, expanding the width of L-shaped search space restriction from narrow one to wider ones successively. Using this method, machine time was reduced to one-fourth and the routing completion ratio was more than 10% higher in experimental comparison with singly restricted routers of no iteration. This paper also discusses an analysis to help to decide the iteration number and L-shaped path width.

References

[1]
Akers, S. B., "Design Automation of Digital Systems," ed. Breuer, Prentice Hall Inc., 1972, pp. 316-317.
[2]
Lee, C. Y., "An Algorithm for Path Connections and Its Applications," IRE Trans. on Electronic Computers, vol. EC-10, No. 3, Sept. 1961, pp. 346-365.
[3]
Rubin, F., "The Lee Path Connection Algorithm," IEEE Trans. on Computers, vol. C-23, No. 9, Sept. 1974, pp. 907-914.
[4]
Soukup, J., "Fast Maze Router," Proc., 15th DA Conference, pp. 100-102, June 1978.

Cited By

View all
  • (1983)Internal connection problem in large optimized PLAsProceedings of the 20th Design Automation Conference10.5555/800032.800763(795-802)Online publication date: 27-Jun-1983

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DAC '80: Proceedings of the 17th Design Automation Conference
June 1980
642 pages
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 June 1980

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

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

Upcoming Conference

DAC '25
62nd ACM/IEEE Design Automation Conference
June 22 - 26, 2025
San Francisco , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)23
  • Downloads (Last 6 weeks)6
Reflects downloads up to 17 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (1983)Internal connection problem in large optimized PLAsProceedings of the 20th Design Automation Conference10.5555/800032.800763(795-802)Online publication date: 27-Jun-1983

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media