EUVIMEDEUVIMED entdecken
Crossref

SPTA 2.0: Enhanced Scalable Parallel Track Assignment Algorithm with Two-Stage Partition Considering Timing Delay

Huayang Cai, Pengcheng Huang, Genggeng Liu, Xing Huang, Yidan Jing, Wenhao Liu, Ting-Chi Wang

ACM Transactions on Design Automation of Electronic Systems · 31.03.2025 · 30 (2) · 1-23

DOI: 10.1145/3712009 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Design Automation of Electronic Systems, online erschienen am 06.02.2025. Verfasst von Huayang Cai und 6 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 39 Literaturangaben. Gefördert von: National Natural Science Foundation of China, National Foreign Experts Program, Natural Science Foundation of Fujian Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Routability has always been a significant challenge in Very Large Scale Integration (VLSI) design. To overcome the potential mismatch between the global routing results and the detailed routing requirements, track assignment is introduced to achieve an efficient routability estimation. Moreover, with the increasing scale of circuits, the intricate interconnections among the components on the chip lead to increased timing delay in signal transmission, thereby significantly impacting the performance and reliability of the circuit. Thus, to further improve the routability of the circuit, it is also critical to realize an accurate estimation of the timing delay within the track assignment stage. Existing heuristic track assignment algorithms, however, are prone to local optimality, and thus fail to provide accurate routability estimations. In this article, we propose an enhanced scalable parallel track assignment algorithm called SPTA 2.0 for VLSI design, employing a two-stage partition strategy and considering timing delay. First, the proposed algorithm achieves efficient assignment of all wires by considering the routing information from both the global and local nets. Second, the overlap cost, the blockage cost, and the wirelength cost can be minimized to significantly improve the routability. Third, a critical wire controlling strategy is proposed to optimize signal timing delays inside nets. Finally, a two-stage partition strategy and a panel-subpanel-level parallelism are designed to further reduce the runtime, improving the scalability of the proposed methodology. Experimental results on multiple benchmarks demonstrate that the proposed method provides better routability estimations, and leads to superior track assignment solutions compared with existing algorithms.

Förderung

  • National Natural Science Foundation of China
  • National Foreign Experts Program
  • Natural Science Foundation of Fujian Province

Zitieren

APA

Cai, H., Huang, P., Liu, G., Huang, X., Jing, Y., Liu, W., & Wang, T. (2025). SPTA 2.0: Enhanced Scalable Parallel Track Assignment Algorithm with Two-Stage Partition Considering Timing Delay. ACM Transactions on Design Automation of Electronic Systems, 30(2), 1-23. https://doi.org/10.1145/3712009

Vancouver

Cai H, Huang P, Liu G, Huang X, Jing Y, Liu W, et al. SPTA 2.0: Enhanced Scalable Parallel Track Assignment Algorithm with Two-Stage Partition Considering Timing Delay. ACM Transactions on Design Automation of Electronic Systems. 2025;30(2):1-23. doi:10.1145/3712009

BibTeX
@article{Cai2025,
  author = {Cai, Huayang and Huang, Pengcheng and Liu, Genggeng and Huang, Xing and Jing, Yidan and Liu, Wenhao and Wang, Ting-Chi},
  title = {SPTA 2.0: Enhanced Scalable Parallel Track Assignment Algorithm with Two-Stage Partition Considering Timing Delay},
  journal = {ACM Transactions on Design Automation of Electronic Systems},
  year = {2025},
  volume = {30},
  number = {2},
  pages = {1--23},
  doi = {10.1145/3712009}
}
Kostenlos starten →