Late Breaking Results: An Efficient and Scalable Track Assignment with GPU Parallelism

The track assignment has been introduced between global routing and detail routing. Based on the independence and divisibility of track assignment, we propose a GPU-accelerated parallel track assignment algorithm. To estimate routability more accurately, the proposed algorithm simultaneously conside...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2025 62nd ACM/IEEE Design Automation Conference (DAC) s. 1 - 2
Hlavní autoři: Liu, Genggeng, Huang, Pengcheng, Li, Zepeng, Liu, Wen-Hao, Huang, Xing, Guo, Wenzhong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 22.06.2025
Témata:
Accuracy
Backtracking
Design automation
Estimation
Graphics processing units
Optimization
Parallel processing
Prediction algorithms
Reliability engineering
Routing
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The track assignment has been introduced between global routing and detail routing. Based on the independence and divisibility of track assignment, we propose a GPU-accelerated parallel track assignment algorithm. To estimate routability more accurately, the proposed algorithm simultaneously considers global and local nets, and incorporates several strategies for optimization. Moreover, an asynchronous parallelism strategy is proposed to divide the computation of routing resources and the track assignment into fine-grained tasks. Experimental results show that, compared to related work, our algorithm achieves a significant speedup with a better routability estimation.
DOI:10.1109/DAC63849.2025.11133311