Routing with graphene nanoribbons

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

doi:10.1109/ASPDAC.2011.5722208

Routing with graphene nanoribbons

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

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

20 Citations (Scopus)

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 language	English
Title of host publication	Proceedings of The 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011
Place of Publication	9781424475162
Publisher	IEEE
Pages	323-329
Number of pages	7
ISBN (Print)	9781424475155
DOIs	https://doi.org/10.1109/ASPDAC.2011.5722208
Publication status	Published - 27 Jan 2011
Event	16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011 - Pacifico Yokohama, Yokohama, Japan Duration: 25 Jan 2011 → 28 Jan 2011 https://www.aspdac.com/aspdac2011/ (Conference website) https://www.aspdac.com/aspdac2011/archive/program/ (Conference programme) https://ieeexplore.ieee.org/xpl/conhome/5716646/proceeding (Conference proceedings)

Publication series

Name	Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
ISSN (Print)	2153-6961
ISSN (Electronic)	2153-697X

Conference

Conference	16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011
Country/Territory	Japan
City	Yokohama
Period	25/01/11 → 28/01/11
Internet address	https://www.aspdac.com/aspdac2011/ (Conference website) https://www.aspdac.com/aspdac2011/archive/program/ (Conference programme) https://ieeexplore.ieee.org/xpl/conhome/5716646/proceeding (Conference proceedings)

Scopus Subject Areas

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

Access to Document

10.1109/ASPDAC.2011.5722208

Cite this

@inproceedings{39906cecf1a743de82e331e8a2e023f1,

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",

note = "This work was partially supported by the National Science Foundation under grant CCF-1017516 and CCF-0746608.; 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011 ; Conference date: 25-01-2011 Through 28-01-2011",

year = "2011",

month = jan,

day = "27",

doi = "10.1109/ASPDAC.2011.5722208",

language = "English",

isbn = "9781424475155",

series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

publisher = "IEEE",

pages = "323--329",

booktitle = "Proceedings of The 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011",

address = "United States",

url = "https://www.aspdac.com/aspdac2011/, https://www.aspdac.com/aspdac2011/archive/program/, https://ieeexplore.ieee.org/xpl/conhome/5716646/proceeding",

}

Yan, T, Ma, Q, Chilstedt, S, Wong, MDF & Chen, D 2011, Routing with graphene nanoribbons. in Proceedings of The 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011. Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, IEEE, 9781424475162, pp. 323-329, 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011, Yokohama, Japan, 25/01/11. https://doi.org/10.1109/ASPDAC.2011.5722208

Routing with graphene nanoribbons. / Yan, Tan; Ma, Qiang; Chilstedt, Scott et al.
Proceedings of The 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011. 9781424475162: IEEE, 2011. p. 323-329 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - Routing with graphene nanoribbons

AU - Yan, Tan

AU - Ma, Qiang

AU - Chilstedt, Scott

AU - Wong, Martin D. F.

AU - Chen, Deming

N1 - This work was partially supported by the National Science Foundation under grant CCF-1017516 and CCF-0746608.

PY - 2011/1/27

Y1 - 2011/1/27

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

U2 - 10.1109/ASPDAC.2011.5722208

DO - 10.1109/ASPDAC.2011.5722208

M3 - Conference proceeding

AN - SCOPUS:79952972780

SN - 9781424475155

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

SP - 323

EP - 329

BT - Proceedings of The 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011

PB - IEEE

CY - 9781424475162

T2 - 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011

Y2 - 25 January 2011 through 28 January 2011

ER -

Routing with graphene nanoribbons

Abstract

Publication series

Conference

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this