CORONA: A k-COnnected RObust Interconnection Network Generation Algorithm

Abstract

In the paper, we propose a k-connected robust interconnection network (k-RN) for open fault tolerance and design a k-RN generation algorithm to handle large interconnected networks. In a k-RN, any vertex pair has at least k disjoint connections and can tolerate k-l opens. To realize k RN in current large networks, we design an effective $O(n\log n)$-time algorithm, Corona, with a novel approach for total connection length reduction. Experiments in IC design application show that Corona can practically handle large nets with 100k pins in a few minutes each. The quality in terms of total wire length of Corona is within 1.6% on average to an $O(n^{3})$-time approximation algorithm, and within 4.7% to exact optimum solutions.