Algorithmic study on the routing reliability problem

Conventional CMOS devices are facing an increasing number of challenges as the feature sizes scale down. In the meantime, new nanoscale materials, like graphene nanoribbons (GNR), have been shown to have large integration capability, and thus will probably replace CMOS devices in the future. However, in practice, the GNR wire segments can have a connection defective rate. Particularly, each wire segment has a survival probability, and thus has a chance to fail. This makes the routing in traditional ways very unreliable. In this paper, we study the routing reliability problem and propose an algorithm flow to solve it. Given a s-t routing path on a routing graph, we try to reinforce the reliability of the routing path by adding redundant wiring segments in such a way that its survival probability is maximized with a reasonable overhead of routing resources. Our proposed algorithm flow is two-fold: (1) generation of candidate redundancy segment via min-cost max-flow; (2) optimal selection among the candidates by dynamic programming. The results of extensive experiments confirm the effectiveness and efficiency of our approach.

[1]  Martin D. F. Wong,et al.  Routing with graphene nanoribbons , 2011, 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011).

[2]  J. Lyding,et al.  The influence of edge structure on the electronic properties of graphene quantum dots and nanoribbons. , 2009, Nature materials.

[3]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[4]  Kun Yuan,et al.  BoxRouter 2.0: architecture and implementation of a hybrid and robust global router , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[5]  Liang Deng,et al.  An exact algorithm for the statistical shortest path problem , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[6]  J.A. Roy,et al.  High-performance routing at the nanometer scale , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[7]  Carl Ebeling,et al.  PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[8]  Andrew B. Kahng,et al.  Nontree routing for reliability and yield improvement [IC layout] , 2004, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[10]  Muhammet Mustafa Ozdal,et al.  Archer: a history-driven global routing algorithm , 2007, ICCAD 2007.

[11]  A.B. Kahng,et al.  Nontree routing for reliability and yield improvement [IC layout] , 2002, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  SUPARNA DUTTASINHA,et al.  Graphene: Status and Prospects , 2009, Science.

[13]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[14]  K. Jenkins,et al.  Operation of graphene transistors at gigahertz frequencies. , 2008, Nano letters.

[15]  Shekhar Y. Borkar,et al.  Designing reliable systems from unreliable components: the challenges of transistor variability and degradation , 2005, IEEE Micro.

[16]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[17]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[18]  Charles J. Colbourn,et al.  Series-Parallel Bounds for the Two-Terminal Reliability Problem , 1989, INFORMS J. Comput..