The Repetitive Turn Model for Adaptive Routing

For 2D mesh based Network-on-Chip (NoC), the prohibited turns of routing algorithms should be repetitively distributed in order for the routing algorithms to be implemented by logic-based circuit. In this paper, we aim to exploit the designing space for logicbased routing algorithms, and propose new...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 2017-01, Vol.66 (1), p.138-146
Hauptverfasser: Minghua Tang, Xiaola Lin, Palesi, Maurizio
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 146
container_issue 1
container_start_page 138
container_title IEEE transactions on computers
container_volume 66
creator Minghua Tang
Xiaola Lin
Palesi, Maurizio
description For 2D mesh based Network-on-Chip (NoC), the prohibited turns of routing algorithms should be repetitively distributed in order for the routing algorithms to be implemented by logic-based circuit. In this paper, we aim to exploit the designing space for logicbased routing algorithms, and propose new logic-based routing algorithms that outperform the state-of-the-art counterparts. Toward this direction, we firstly construct all routing algorithms for 5 x 5 2D mesh topology. Then we select those routing algorithms which have repetitive prohibited turns across both the network rows and columns. In addition, we chose those routing algorithms that have smaller routing pressures than Odd-Even routing algorithm. Then the routing algorithms for 2D mesh topology ranging from 6 x 6 to 15 x 15 are respectively constructed according to the prohibited turns distribution of the selected routing algorithms. Two routing algorithms that have smaller routing pressures than Odd-Even routing algorithm are obtained for all considered networks. The obtained logic-based routing algorithms are called as Repetitive Turn Model (RTM). Simulation results show that RTM could achieve up to 51% performance improvement as compared to Odd-Even routing algorithm.
doi_str_mv 10.1109/TC.2016.2564961
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_7466832</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7466832</ieee_id><sourcerecordid>1848270273</sourcerecordid><originalsourceid>FETCH-LOGICAL-c289t-248fad2c383099a5bd915a78479b493368e4950330793517b6bbbf9cbe917afa3</originalsourceid><addsrcrecordid>eNo9kE1Lw0AQhhdRsFbPHrwEPCed_d45lqBVqAglnpfdZKMptYmbRPDfm9riaWB43neGh5BbChmlgIsizxhQlTGpBCp6RmZUSp0iSnVOZgDUpMgFXJKrvt8CgGKAM5IVHyHZhC4MzdB8h6QY4z55aauwS-o2JsvKdX_7TTsOzf79mlzUbteHm9Ock7fHhyJ_Stevq-d8uU5LZnBImTC1q1jJDQdEJ32FVDpthEYvkHNlgkAJnINGLqn2yntfY-kDUu1qx-fk_tjbxfZrDP1gt-302XTSUiMM08A0n6jFkSpj2_cx1LaLzaeLP5aCPUixRW4PUuxJypS4OyaaEMI_rYVShjP-Cx37Ws8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1848270273</pqid></control><display><type>article</type><title>The Repetitive Turn Model for Adaptive Routing</title><source>IEEE Electronic Library (IEL)</source><creator>Minghua Tang ; Xiaola Lin ; Palesi, Maurizio</creator><creatorcontrib>Minghua Tang ; Xiaola Lin ; Palesi, Maurizio</creatorcontrib><description>For 2D mesh based Network-on-Chip (NoC), the prohibited turns of routing algorithms should be repetitively distributed in order for the routing algorithms to be implemented by logic-based circuit. In this paper, we aim to exploit the designing space for logicbased routing algorithms, and propose new logic-based routing algorithms that outperform the state-of-the-art counterparts. Toward this direction, we firstly construct all routing algorithms for 5 x 5 2D mesh topology. Then we select those routing algorithms which have repetitive prohibited turns across both the network rows and columns. In addition, we chose those routing algorithms that have smaller routing pressures than Odd-Even routing algorithm. Then the routing algorithms for 2D mesh topology ranging from 6 x 6 to 15 x 15 are respectively constructed according to the prohibited turns distribution of the selected routing algorithms. Two routing algorithms that have smaller routing pressures than Odd-Even routing algorithm are obtained for all considered networks. The obtained logic-based routing algorithms are called as Repetitive Turn Model (RTM). Simulation results show that RTM could achieve up to 51% performance improvement as compared to Odd-Even routing algorithm.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/TC.2016.2564961</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Adaptation models ; Algorithm design and analysis ; Algorithms ; Finite element method ; logic-based routing ; Mathematical models ; Mesh networks ; Network topology ; Network-on-Chip ; Repetition ; Routing ; Routing (telecommunications) ; routing algorithm ; routing pressure ; System recovery ; table-based routing ; Topology</subject><ispartof>IEEE transactions on computers, 2017-01, Vol.66 (1), p.138-146</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c289t-248fad2c383099a5bd915a78479b493368e4950330793517b6bbbf9cbe917afa3</citedby><cites>FETCH-LOGICAL-c289t-248fad2c383099a5bd915a78479b493368e4950330793517b6bbbf9cbe917afa3</cites><orcidid>0000-0001-9378-1229</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7466832$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7466832$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Minghua Tang</creatorcontrib><creatorcontrib>Xiaola Lin</creatorcontrib><creatorcontrib>Palesi, Maurizio</creatorcontrib><title>The Repetitive Turn Model for Adaptive Routing</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>For 2D mesh based Network-on-Chip (NoC), the prohibited turns of routing algorithms should be repetitively distributed in order for the routing algorithms to be implemented by logic-based circuit. In this paper, we aim to exploit the designing space for logicbased routing algorithms, and propose new logic-based routing algorithms that outperform the state-of-the-art counterparts. Toward this direction, we firstly construct all routing algorithms for 5 x 5 2D mesh topology. Then we select those routing algorithms which have repetitive prohibited turns across both the network rows and columns. In addition, we chose those routing algorithms that have smaller routing pressures than Odd-Even routing algorithm. Then the routing algorithms for 2D mesh topology ranging from 6 x 6 to 15 x 15 are respectively constructed according to the prohibited turns distribution of the selected routing algorithms. Two routing algorithms that have smaller routing pressures than Odd-Even routing algorithm are obtained for all considered networks. The obtained logic-based routing algorithms are called as Repetitive Turn Model (RTM). Simulation results show that RTM could achieve up to 51% performance improvement as compared to Odd-Even routing algorithm.</description><subject>Adaptation models</subject><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Finite element method</subject><subject>logic-based routing</subject><subject>Mathematical models</subject><subject>Mesh networks</subject><subject>Network topology</subject><subject>Network-on-Chip</subject><subject>Repetition</subject><subject>Routing</subject><subject>Routing (telecommunications)</subject><subject>routing algorithm</subject><subject>routing pressure</subject><subject>System recovery</subject><subject>table-based routing</subject><subject>Topology</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1Lw0AQhhdRsFbPHrwEPCed_d45lqBVqAglnpfdZKMptYmbRPDfm9riaWB43neGh5BbChmlgIsizxhQlTGpBCp6RmZUSp0iSnVOZgDUpMgFXJKrvt8CgGKAM5IVHyHZhC4MzdB8h6QY4z55aauwS-o2JsvKdX_7TTsOzf79mlzUbteHm9Ock7fHhyJ_Stevq-d8uU5LZnBImTC1q1jJDQdEJ32FVDpthEYvkHNlgkAJnINGLqn2yntfY-kDUu1qx-fk_tjbxfZrDP1gt-302XTSUiMM08A0n6jFkSpj2_cx1LaLzaeLP5aCPUixRW4PUuxJypS4OyaaEMI_rYVShjP-Cx37Ws8</recordid><startdate>20170101</startdate><enddate>20170101</enddate><creator>Minghua Tang</creator><creator>Xiaola Lin</creator><creator>Palesi, Maurizio</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-9378-1229</orcidid></search><sort><creationdate>20170101</creationdate><title>The Repetitive Turn Model for Adaptive Routing</title><author>Minghua Tang ; Xiaola Lin ; Palesi, Maurizio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c289t-248fad2c383099a5bd915a78479b493368e4950330793517b6bbbf9cbe917afa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Adaptation models</topic><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Finite element method</topic><topic>logic-based routing</topic><topic>Mathematical models</topic><topic>Mesh networks</topic><topic>Network topology</topic><topic>Network-on-Chip</topic><topic>Repetition</topic><topic>Routing</topic><topic>Routing (telecommunications)</topic><topic>routing algorithm</topic><topic>routing pressure</topic><topic>System recovery</topic><topic>table-based routing</topic><topic>Topology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Minghua Tang</creatorcontrib><creatorcontrib>Xiaola Lin</creatorcontrib><creatorcontrib>Palesi, Maurizio</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Minghua Tang</au><au>Xiaola Lin</au><au>Palesi, Maurizio</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Repetitive Turn Model for Adaptive Routing</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>2017-01-01</date><risdate>2017</risdate><volume>66</volume><issue>1</issue><spage>138</spage><epage>146</epage><pages>138-146</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>For 2D mesh based Network-on-Chip (NoC), the prohibited turns of routing algorithms should be repetitively distributed in order for the routing algorithms to be implemented by logic-based circuit. In this paper, we aim to exploit the designing space for logicbased routing algorithms, and propose new logic-based routing algorithms that outperform the state-of-the-art counterparts. Toward this direction, we firstly construct all routing algorithms for 5 x 5 2D mesh topology. Then we select those routing algorithms which have repetitive prohibited turns across both the network rows and columns. In addition, we chose those routing algorithms that have smaller routing pressures than Odd-Even routing algorithm. Then the routing algorithms for 2D mesh topology ranging from 6 x 6 to 15 x 15 are respectively constructed according to the prohibited turns distribution of the selected routing algorithms. Two routing algorithms that have smaller routing pressures than Odd-Even routing algorithm are obtained for all considered networks. The obtained logic-based routing algorithms are called as Repetitive Turn Model (RTM). Simulation results show that RTM could achieve up to 51% performance improvement as compared to Odd-Even routing algorithm.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TC.2016.2564961</doi><tpages>9</tpages><orcidid>https://orcid.org/0000-0001-9378-1229</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0018-9340
ispartof IEEE transactions on computers, 2017-01, Vol.66 (1), p.138-146
issn 0018-9340
1557-9956
language eng
recordid cdi_ieee_primary_7466832
source IEEE Electronic Library (IEL)
subjects Adaptation models
Algorithm design and analysis
Algorithms
Finite element method
logic-based routing
Mathematical models
Mesh networks
Network topology
Network-on-Chip
Repetition
Routing
Routing (telecommunications)
routing algorithm
routing pressure
System recovery
table-based routing
Topology
title The Repetitive Turn Model for Adaptive Routing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T02%3A00%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Repetitive%20Turn%20Model%20for%20Adaptive%20Routing&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Minghua%20Tang&rft.date=2017-01-01&rft.volume=66&rft.issue=1&rft.spage=138&rft.epage=146&rft.pages=138-146&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/TC.2016.2564961&rft_dat=%3Cproquest_RIE%3E1848270273%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1848270273&rft_id=info:pmid/&rft_ieee_id=7466832&rfr_iscdi=true