Routing Pressure: A Channel-Related and Traffic-Aware Metric of Routing Algorithm
How to precisely measure performance of routing algorithm is an important issue when studying routing algorithm of network-on-chip (NoC). The degree of adaptiveness is the most widely used metric in the literature. However, our study shows that the degree of adaptiveness cannot precisely measure per...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on parallel and distributed systems 2015-03, Vol.26 (3), p.891-901 |
|---|---|
| Hauptverfasser: | , , |
| 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 | 901 |
|---|---|
| container_issue | 3 |
| container_start_page | 891 |
| container_title | IEEE transactions on parallel and distributed systems |
| container_volume | 26 |
| creator | Minghua Tang Xiaola Lin Palesi, Maurizio |
| description | How to precisely measure performance of routing algorithm is an important issue when studying routing algorithm of network-on-chip (NoC). The degree of adaptiveness is the most widely used metric in the literature. However, our study shows that the degree of adaptiveness cannot precisely measure performance of routing algorithm. It cannot account for why routing algorithm with high degree of adaptiveness may have poor performance. Simulation has to be carried out to evaluate performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring performance of routing algorithm. It has higher precision of measuring routing algorithm performance than the degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation. |
| doi_str_mv | 10.1109/TPDS.2013.184 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1699226446</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6570725</ieee_id><sourcerecordid>3760053251</sourcerecordid><originalsourceid>FETCH-LOGICAL-c285t-b099874a5d4618695ddb8e20990db4f2588487dbb5566f10d34c991aed97bd7e3</originalsourceid><addsrcrecordid>eNo9kM9LwzAUx4MoOKdHT14CnjOTNEkTb2X-hIlzznNIm9eto2tn0iL-93ZMPb3H4_O-X_ggdMnohDFqbpbzu_cJpyyZMC2O0IhJqQlnOjkediokMZyZU3QW44ZSJiQVI_S2aPuualZ4HiDGPsAtzvB07ZoGarKA2nXgsWs8XgZXllVBsi8XAL9AF6oCtyX--8_qVRuqbr09RyelqyNc_M4x-ni4X06fyOz18XmazUjBtexITo3RqXDSC8W0MtL7XAMfrtTnouRSa6FTn-dSKlUy6hNRGMMceJPmPoVkjK4PubvQfvYQO7tp-9AMlZYpYzhXQqiBIgeqCG2MAUq7C9XWhW_LqN1bs3trdm_NDtYG_urAVwDwzyqZ0pTL5AfA5Gcf</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1699226446</pqid></control><display><type>article</type><title>Routing Pressure: A Channel-Related and Traffic-Aware Metric of Routing Algorithm</title><source>IEEE Electronic Library (IEL)</source><creator>Minghua Tang ; Xiaola Lin ; Palesi, Maurizio</creator><creatorcontrib>Minghua Tang ; Xiaola Lin ; Palesi, Maurizio</creatorcontrib><description>How to precisely measure performance of routing algorithm is an important issue when studying routing algorithm of network-on-chip (NoC). The degree of adaptiveness is the most widely used metric in the literature. However, our study shows that the degree of adaptiveness cannot precisely measure performance of routing algorithm. It cannot account for why routing algorithm with high degree of adaptiveness may have poor performance. Simulation has to be carried out to evaluate performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring performance of routing algorithm. It has higher precision of measuring routing algorithm performance than the degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/TPDS.2013.184</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Adaptation models ; Algorithm design and analysis ; Algorithms ; Alliances ; channel pressure ; Computational modeling ; Computer industry ; metric of routing ; network-on-chip ; Pressure measurement ; Routing ; routing algorithm ; Routing pressure ; Topology</subject><ispartof>IEEE transactions on parallel and distributed systems, 2015-03, Vol.26 (3), p.891-901</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c285t-b099874a5d4618695ddb8e20990db4f2588487dbb5566f10d34c991aed97bd7e3</citedby><cites>FETCH-LOGICAL-c285t-b099874a5d4618695ddb8e20990db4f2588487dbb5566f10d34c991aed97bd7e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6570725$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6570725$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Minghua Tang</creatorcontrib><creatorcontrib>Xiaola Lin</creatorcontrib><creatorcontrib>Palesi, Maurizio</creatorcontrib><title>Routing Pressure: A Channel-Related and Traffic-Aware Metric of Routing Algorithm</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>How to precisely measure performance of routing algorithm is an important issue when studying routing algorithm of network-on-chip (NoC). The degree of adaptiveness is the most widely used metric in the literature. However, our study shows that the degree of adaptiveness cannot precisely measure performance of routing algorithm. It cannot account for why routing algorithm with high degree of adaptiveness may have poor performance. Simulation has to be carried out to evaluate performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring performance of routing algorithm. It has higher precision of measuring routing algorithm performance than the degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation.</description><subject>Adaptation models</subject><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Alliances</subject><subject>channel pressure</subject><subject>Computational modeling</subject><subject>Computer industry</subject><subject>metric of routing</subject><subject>network-on-chip</subject><subject>Pressure measurement</subject><subject>Routing</subject><subject>routing algorithm</subject><subject>Routing pressure</subject><subject>Topology</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kM9LwzAUx4MoOKdHT14CnjOTNEkTb2X-hIlzznNIm9eto2tn0iL-93ZMPb3H4_O-X_ggdMnohDFqbpbzu_cJpyyZMC2O0IhJqQlnOjkediokMZyZU3QW44ZSJiQVI_S2aPuualZ4HiDGPsAtzvB07ZoGarKA2nXgsWs8XgZXllVBsi8XAL9AF6oCtyX--8_qVRuqbr09RyelqyNc_M4x-ni4X06fyOz18XmazUjBtexITo3RqXDSC8W0MtL7XAMfrtTnouRSa6FTn-dSKlUy6hNRGMMceJPmPoVkjK4PubvQfvYQO7tp-9AMlZYpYzhXQqiBIgeqCG2MAUq7C9XWhW_LqN1bs3trdm_NDtYG_urAVwDwzyqZ0pTL5AfA5Gcf</recordid><startdate>201503</startdate><enddate>201503</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></search><sort><creationdate>201503</creationdate><title>Routing Pressure: A Channel-Related and Traffic-Aware Metric of Routing Algorithm</title><author>Minghua Tang ; Xiaola Lin ; Palesi, Maurizio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c285t-b099874a5d4618695ddb8e20990db4f2588487dbb5566f10d34c991aed97bd7e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Adaptation models</topic><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Alliances</topic><topic>channel pressure</topic><topic>Computational modeling</topic><topic>Computer industry</topic><topic>metric of routing</topic><topic>network-on-chip</topic><topic>Pressure measurement</topic><topic>Routing</topic><topic>routing algorithm</topic><topic>Routing pressure</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 & 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 parallel and distributed systems</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>Routing Pressure: A Channel-Related and Traffic-Aware Metric of Routing Algorithm</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>2015-03</date><risdate>2015</risdate><volume>26</volume><issue>3</issue><spage>891</spage><epage>901</epage><pages>891-901</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>How to precisely measure performance of routing algorithm is an important issue when studying routing algorithm of network-on-chip (NoC). The degree of adaptiveness is the most widely used metric in the literature. However, our study shows that the degree of adaptiveness cannot precisely measure performance of routing algorithm. It cannot account for why routing algorithm with high degree of adaptiveness may have poor performance. Simulation has to be carried out to evaluate performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring performance of routing algorithm. It has higher precision of measuring routing algorithm performance than the degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPDS.2013.184</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1045-9219 |
| ispartof | IEEE transactions on parallel and distributed systems, 2015-03, Vol.26 (3), p.891-901 |
| issn | 1045-9219 1558-2183 |
| language | eng |
| recordid | cdi_proquest_journals_1699226446 |
| source | IEEE Electronic Library (IEL) |
| subjects | Adaptation models Algorithm design and analysis Algorithms Alliances channel pressure Computational modeling Computer industry metric of routing network-on-chip Pressure measurement Routing routing algorithm Routing pressure Topology |
| title | Routing Pressure: A Channel-Related and Traffic-Aware Metric of Routing Algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T16%3A58%3A07IST&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=Routing%20Pressure:%20A%20Channel-Related%20and%20Traffic-Aware%20Metric%20of%20Routing%20Algorithm&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Minghua%20Tang&rft.date=2015-03&rft.volume=26&rft.issue=3&rft.spage=891&rft.epage=901&rft.pages=891-901&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/TPDS.2013.184&rft_dat=%3Cproquest_RIE%3E3760053251%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=1699226446&rft_id=info:pmid/&rft_ieee_id=6570725&rfr_iscdi=true |