https://scholars.lib.ntu.edu.tw/handle/123456789/559314
標題: | A provably good wavelength-division-multiplexing-aware clustering algorithm for on-chip optical routing | 作者: | Lu, Y.-S. Yu, S.-J. YAO-WEN CHANG |
公開日期: | 2020 | 卷: | 2020-July | 來源出版物: | Proceedings - Design Automation Conference | 摘要: | As the VLSI technology continues to scale down, combined with increasing demands for large bandwidth and low-power consumption, the optical interconnections with Wavelength Division Multiplexing (WDM) become an attractive alternative for on-chip signal transmission. Previous WDM-aware optical routing works consist of two main drawbacks: they are based mainly on heuristics or restricted integer linear programming to handle optical routing, and the addressed types of transmission loss and WDM overheads are incomplete. As a result, no performance guarantees can be achieved on their WDM clustering results, and/or their computations are too time-consuming. To remedy these disadvantages, we present a polynomial-time provably good WDM-aware clustering algorithm and a new WDM-aware optical routing flow to minimize the transmission loss and the WDM overheads with a significant speedup. The proposed WDM-aware clustering algorithm guarantees to find an optimal solution for 1-, 2-, and 3-path clustering, and has the constant performance bound 3 for most cases of 4-path clustering. Experimental results based on the ISPD 2007 and 2019 contest benchmarks and a real optical design show that our optical router significantly outperforms published works in wirelength, transmission loss, wavelength power, and runtimes. © 2020 IEEE. |
URI: | https://www.scopus.com/inward/record.url?eid=2-s2.0-85093955391&partnerID=40&md5=e679f81af77fac626d5082b908994b84 https://scholars.lib.ntu.edu.tw/handle/123456789/559314 |
ISSN: | 0738100X | DOI: | 10.1109/DAC18072.2020.9218637 | SDG/關鍵字: | Computer aided design; Electric load loss; Integer programming; Optical design; Optical flows; Polynomial approximation; Routers; Routing algorithms; Wave transmission; Clustering results; Integer Linear Programming; Low-power consumption; On-chip signals; Optimal solutions; Performance bounds; Performance guarantees; Transmission loss; Clustering algorithms |
顯示於: | 電信工程學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。