On-Chip Optical Routing With Provably Good Algorithms for Path Clustering and Assignment

• Published in: IEEE transactions on computer-aided design of integrated circuits and systems Vol. 41; no. 11; pp. 4653 - 4666
• Main Authors: Lu, Yu-Sheng, Yu, Sheng-Jung, Chang, Yao-Wen
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.11.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Approximation algorithm; Clustering; Computer networks; Crosstalk; Insertion loss; Integer programming; Integrated circuits; Linear programming; Military communications; Network reliability; network-on-chip (NoC); Optical communication; Optical crosstalk; Optical design; Optical interconnections; Optical interconnects; Optical losses; Optical noise; physical design; Power consumption; Routing; Signal transmission; Wavelength division multiplexing; wavelength-division multiplexing (WDM)
• ISSN: 0278-0070; 1937-4151
• DOI: 10.1109/TCAD.2021.3133856

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 three main drawbacks: they are based mainly on heuristics or restricted integer linear programming to handle optical routing, the addressed types of insertion loss, and WDM overheads are incomplete, and the crosstalk noise during concurrent signal transmission is neglected. As a result, no performance guarantees can be achieved on their WDM clustering results, the reliability of the optical network is impaired, and/or their computations are too time consuming. To remedy these disadvantages, we present a new WDM-aware optical routing flow to minimize the insertion loss, the WDM overheads, and the crosstalk noise with a significant speedup. In the proposed flow, the WDM-aware path clustering algorithm guarantees to find an optimal solution for 1-, 2-, and 3-path clustering and has the constant performance bound for most cases of 4-path clustering; the crosstalk-aware path assignment guarantees to minimize the number of crosstalk signal pairs within the given displacement bound. 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, insertion loss, wavelength power, crosstalk noise, and runtimes.