research-article

A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus Routing

Authors:

Shao-Chun Hung,

Yao-Wen ChangAuthors Info & Claims

DAC '19: Proceedings of the 56th Annual Design Automation Conference 2019

Article No.: 217, Pages 1 - 6

https://doi.org/10.1145/3316781.3317740

Published: 02 June 2019 Publication History

Abstract

As clock frequencies increase, topology-matching bus routing is desired to provide an initial routing result which facilitates the following buffer insertion to meet the timing constraints. Our algorithm consists of three main techniques: (1) a bus clustering method to reduce the routing complexity, (2) a DAG-based algorithm to connect a bus in the specific topology, and (3) a rip-up and re-route scheme to alleviate the routing congestion. Experimental results show that our proposed algorithm outperforms all the participating teams of the 2018 CAD Contest at ICCAD, where the top-3 routers result in 145%, 158%, and 420% higher costs than ours.

References

[1]

LEMON Graph Library. www.lemon.cs.elte.hu/trac/lemon, 2014.

[2]

2018 ICCAD CAD Contest. www.iccad-contest.org/2018/problems, 2018.

[3]

The Boost C+ + Libraries. www.boost.org/users/history/version_l_67_0, 2018.

[4]

Y. Badr, A. Torres, and P. Gupta. Mask assignment and synthesis of DSA-MP hybrid lithography for sub-7nm contacts/vias. In Proc. of DAC, 2015.

Digital Library

[5]

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Third Edition. 3rd edition, 2009.

Digital Library

[6]

E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1(1):269--271, 1959.

Digital Library

[7]

L. McMurchie and C. Ebeling. Pathfinder: A negotiation-based performance-driven router for fpgas. In Third International ACM Symposium on Field-Programmable Gate Arrays, 1995.

Digital Library

[8]

F. Mo and R. K. Brayton. Semi-detailed bus routing with variation reduction. In Proc. of ISPD, 2007.

Digital Library

[9]

H.-C. Ou, H.-C. C. Chien, and Y.-W. Chang. Nonuniform multilevel analog routing with matching constraints. IEEE Tran. on CAD, 33(12):1942--1954, 2014.

[10]

M. M. Ozdal and R. F. Hentschke. Exact route matching algorithms for analog and mixed signal integrated circuits. In ICCAD - Digest of Technical Papers, 2009.

Digital Library

[11]

M. M. Ozdal and R. F. Hentschke. Maze routing algorithms with exact matching constraints for analog and mixed signal designs. In Proc. of ICCAD, 2012.

Digital Library

[12]

M. M. Ozdal and M. D. F. Wong. Algorithmic study of single-layer bus routing for high-speed boards. IEEE Tran. on CAD, 25(3):490--503, 2006.

Digital Library

[13]

M. M. Ozdal and M. D. F. Wong. A length-matching routing algorithm for high-performance printed circuit boards. IEEE Tran. on CAD, 25(12):2784--2794, 2006.

Digital Library

[14]

J.-T. Yan and Z.-W. Chen. Obstacle-aware length-matching bus routing. In Proc. of ISPD, 2011.

Digital Library

[15]

T. Yan and M. D. F. Wong. BSG-Route: A length-matching router for general topology. In Proc. of ICCAD, 2008.

Digital Library

Cited By

Liu GWei LXu N(2022)Multi-Strategy Layer Assignment Algorithm Considering Bus Timing MatchingJournal of Computer-Aided Design & Computer Graphics10.3724/SP.J.1089.2022.1944634:04(545-551)Online publication date: 2-Dec-2022
https://doi.org/10.3724/SP.J.1089.2022.19446
Zhang HFujita MCheng CJiang J(2021)SAT-Based On-Track Bus RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.300725340:4(735-747)Online publication date: Apr-2021
https://doi.org/10.1109/TCAD.2020.3007253
Hsu CHung SChen HSun FChang Y(2021)A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.300254640:3(533-546)Online publication date: Mar-2021
https://doi.org/10.1109/TCAD.2020.3002546
Show More Cited By

Index Terms

A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus Routing
1. Hardware
  1. Electronic design automation

Recommendations

Obstacle-aware length-matching bus routing
ISPD '11: Proceedings of the 2011 international symposium on Physical design

As clock frequency increases, signal propagation delay on PCBs is requested to meet the timing specification with very high accuracy. Generally speaking, the net length in a single layer can estimate the routing delay in a single-layer net. In this ...
Obstacle-avoiding free-assignment routing for flip-chip designs
DAC '12: Proceedings of the 49th Annual Design Automation Conference

The flip-chip packaging is introduced for modern IC designs with higher integration density and larger I/O counts. It is necessary to consider routing obstacles for modern flip-chip designs, where the obstacles could be regions blocked for signal ...
Routing-architecture-aware analytical placement for heterogeneous FPGAs
DAC '15: Proceedings of the 52nd Annual Design Automation Conference

Placement is a crucial stage for FPGA implementation. Most FPGA placers optimize their placement results by minimizing half-perimeter wirelength (HPWL). Due to the segmented routing architecture in FPGAs, however, the HPWL function cannot model routed ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DAC '19: Proceedings of the 56th Annual Design Automation Conference 2019

June 2019

1378 pages

ISBN:9781450367257

DOI:10.1145/3316781

Copyright © 2019 ACM.

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

SIGDA: ACM Special Interest Group on Design Automation
IEEE-CEDA

In-Cooperation

SIGBED: ACM Special Interest Group on Embedded Systems

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 June 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

DAC '19

Sponsor:

SIGDA

DAC '19: The 56th Annual Design Automation Conference 2019

June 2 - 6, 2019

NV, Las Vegas, 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

7
Total Citations
View Citations
347
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)1

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Liu GWei LXu N(2022)Multi-Strategy Layer Assignment Algorithm Considering Bus Timing MatchingJournal of Computer-Aided Design & Computer Graphics10.3724/SP.J.1089.2022.1944634:04(545-551)Online publication date: 2-Dec-2022
https://doi.org/10.3724/SP.J.1089.2022.19446
Zhang HFujita MCheng CJiang J(2021)SAT-Based On-Track Bus RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.300725340:4(735-747)Online publication date: Apr-2021
https://doi.org/10.1109/TCAD.2020.3007253
Hsu CHung SChen HSun FChang Y(2021)A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.300254640:3(533-546)Online publication date: Mar-2021
https://doi.org/10.1109/TCAD.2020.3002546
Hariharan KSrimathi BKumaran RYamuna I(2021)Spotting Current Location of the Public Bus with its Destination and Live Details Through Mobile Application2021 International Conference on System, Computation, Automation and Networking (ICSCAN)10.1109/ICSCAN53069.2021.9526424(1-5)Online publication date: 30-Jul-2021
https://doi.org/10.1109/ICSCAN53069.2021.9526424
Jindal AJoshi JSajwan NAdlakha NSingh S(2021)Efficient Use of Randomisation Algorithms for Probability Prediction in Baccarat Using: Monte Carlo and Las Vegas MethodProceedings of the International Conference on Paradigms of Computing, Communication and Data Sciences10.1007/978-981-15-7533-4_8(91-103)Online publication date: 20-Feb-2021
https://doi.org/10.1007/978-981-15-7533-4_8
Zhu WZhang XLiu GGuo WWang T(2020)MiniDeviation: An Efficient Multi-Stage Bus-Aware Global Router2020 International Symposium on VLSI Design, Automation and Test (VLSI-DAT)10.1109/VLSI-DAT49148.2020.9196219(1-4)Online publication date: Aug-2020
https://doi.org/10.1109/VLSI-DAT49148.2020.9196219
Cheng YYu TFang S(2020)Obstacle-Avoiding Length-Matching Bus Routing Considering Nonuniform Track ResourcesIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2020.298531228:8(1881-1892)Online publication date: Aug-2020
https://doi.org/10.1109/TVLSI.2020.2985312

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten