TY - GEN
T1 - Routing with graphene nanoribbons
AU - Yan, Tan
AU - Ma, Qiang
AU - Chilstedt, Scott
AU - Wong, Martin D.F.
AU - Chen, Deming
PY - 2011
Y1 - 2011
N2 - Conventional CMOS devices are facing an increasing number of challenges as their feature sizes scale down. Graphene nanoribbon (GNR) based devices are shown to be a promising replacement of traditional CMOS at future technology nodes. However, all previous works on GNRs focus at the device level. In order to integrate these devices into electronic systems, routing becomes a key issue. In this paper, the GNR routing problem is studied for the first time. We formulate the GNR routing problem as a minimum hybrid-cost shortest path problem on triangular mesh ("hybrid" means that we need to consider both the length and the bending of the routing path). In order to model this hybrid-cost problem, we apply graph expansion and introduce a shortest red-black path problem on the expanded graph. We then propose an algorithm that solves the shortest red-black path problem optimally. This algorithm is then used in a negotiated congestion based routing scheme. Experimental results show that our GNR routing algorithm effectively handles the hybrid cost.
AB - Conventional CMOS devices are facing an increasing number of challenges as their feature sizes scale down. Graphene nanoribbon (GNR) based devices are shown to be a promising replacement of traditional CMOS at future technology nodes. However, all previous works on GNRs focus at the device level. In order to integrate these devices into electronic systems, routing becomes a key issue. In this paper, the GNR routing problem is studied for the first time. We formulate the GNR routing problem as a minimum hybrid-cost shortest path problem on triangular mesh ("hybrid" means that we need to consider both the length and the bending of the routing path). In order to model this hybrid-cost problem, we apply graph expansion and introduce a shortest red-black path problem on the expanded graph. We then propose an algorithm that solves the shortest red-black path problem optimally. This algorithm is then used in a negotiated congestion based routing scheme. Experimental results show that our GNR routing algorithm effectively handles the hybrid cost.
UR - http://www.scopus.com/inward/record.url?scp=79952972780&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79952972780&partnerID=8YFLogxK
U2 - 10.1109/ASPDAC.2011.5722208
DO - 10.1109/ASPDAC.2011.5722208
M3 - Conference contribution
AN - SCOPUS:79952972780
SN - 9781424475155
T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
SP - 323
EP - 329
BT - 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011
T2 - 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011
Y2 - 25 January 2011 through 28 January 2011
ER -