Routing with graphene nanoribbons

Tan Yan, Qiang Ma, Scott Chilstedt, Martin D F Wong, Deming Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011
Pages323-329
Number of pages7
DOIs
StatePublished - Mar 28 2011
Event2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011 - Yokohama, Japan
Duration: Jan 25 2011Jan 28 2011

Publication series

NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Other

Other2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011
CountryJapan
CityYokohama
Period1/25/111/28/11

Fingerprint

Nanoribbons
Graphene
Costs
Routing algorithms

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this

Yan, T., Ma, Q., Chilstedt, S., Wong, M. D. F., & Chen, D. (2011). Routing with graphene nanoribbons. In 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011 (pp. 323-329). [5722208] (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC). https://doi.org/10.1109/ASPDAC.2011.5722208

Routing with graphene nanoribbons. / Yan, Tan; Ma, Qiang; Chilstedt, Scott; Wong, Martin D F; Chen, Deming.

2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011. 2011. p. 323-329 5722208 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yan, T, Ma, Q, Chilstedt, S, Wong, MDF & Chen, D 2011, Routing with graphene nanoribbons. in 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011., 5722208, Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, pp. 323-329, 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011, Yokohama, Japan, 1/25/11. https://doi.org/10.1109/ASPDAC.2011.5722208
Yan T, Ma Q, Chilstedt S, Wong MDF, Chen D. Routing with graphene nanoribbons. In 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011. 2011. p. 323-329. 5722208. (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC). https://doi.org/10.1109/ASPDAC.2011.5722208
Yan, Tan ; Ma, Qiang ; Chilstedt, Scott ; Wong, Martin D F ; Chen, Deming. / Routing with graphene nanoribbons. 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011. 2011. pp. 323-329 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).
@inproceedings{442b7d9be6b24893a517c3b4f0d4dcd5,
title = "Routing with graphene nanoribbons",
abstract = "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.",
author = "Tan Yan and Qiang Ma and Scott Chilstedt and Wong, {Martin D F} and Deming Chen",
year = "2011",
month = "3",
day = "28",
doi = "10.1109/ASPDAC.2011.5722208",
language = "English (US)",
isbn = "9781424475155",
series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",
pages = "323--329",
booktitle = "2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011",

}

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/3/28

Y1 - 2011/3/28

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

ER -