Flow Maximization for NoC Routing Algorithms
In this paper, we apply flow maximization and develop a minimal adaptive routing scheme towards lower average packet latencies in a network-on-chip. The minimal adaptive algorithm allows packets to be forwarded in multiple directions. Typical routing algorithms select the next hop path for each pack...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 340 |
|---|---|
| container_issue | |
| container_start_page | 335 |
| container_title | |
| container_volume | |
| creator | Ying-Cherng Lan Chen, M.C. Su, A.P. Yu-Hen Hu Sao-Jie Chen |
| description | In this paper, we apply flow maximization and develop a minimal adaptive routing scheme towards lower average packet latencies in a network-on-chip. The minimal adaptive algorithm allows packets to be forwarded in multiple directions. Typical routing algorithms select the next hop path for each packet and then resolve conflicts between packets that have been selected to have the same next hop path. We propose a novel decision flow which combines routing direction and port arbitration while maximizing flow. Upon a 2-D mesh NoC, our implementation lowers average packet latencies across all packet injection rates of an NoC. |
| doi_str_mv | 10.1109/ISVLSI.2008.52 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4556817</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4556817</ieee_id><sourcerecordid>4556817</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-f014a28a6f3a92ac8e859540081c26fadc378d3e320d02dddf4ba0508c2635b23</originalsourceid><addsrcrecordid>eNo9zstOwzAUBFDzqERTumXDJh9AwvW1HdvLqqIQKYBEK7aVG9vFKKlREsTj6ykqYjWLoxkNIRcUckpBX5fL52pZ5gigcoFHZKqlAllowagEOCZjpEJnjEt5QpIDoKbq9B8KPSLJb10jakbPSNL3rwBMUY5jcrVo4kd6bz5DG77NEOIu9bFLH-I8fYrvQ9ht01mzjV0YXtr-nIy8aXo3_csJWS1uVvO7rHq8LeezKgsahswD5QaVKTwzGk2tnBJa8P0DWmPhja2ZVJY5hmABrbWebwwIUHtlYoNsQi4Ps8E5t37rQmu6rzUXolBUsh8VaEdN</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Flow Maximization for NoC Routing Algorithms</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ying-Cherng Lan ; Chen, M.C. ; Su, A.P. ; Yu-Hen Hu ; Sao-Jie Chen</creator><creatorcontrib>Ying-Cherng Lan ; Chen, M.C. ; Su, A.P. ; Yu-Hen Hu ; Sao-Jie Chen</creatorcontrib><description>In this paper, we apply flow maximization and develop a minimal adaptive routing scheme towards lower average packet latencies in a network-on-chip. The minimal adaptive algorithm allows packets to be forwarded in multiple directions. Typical routing algorithms select the next hop path for each packet and then resolve conflicts between packets that have been selected to have the same next hop path. We propose a novel decision flow which combines routing direction and port arbitration while maximizing flow. Upon a 2-D mesh NoC, our implementation lowers average packet latencies across all packet injection rates of an NoC.</description><identifier>ISSN: 2159-3469</identifier><identifier>ISBN: 0769532918</identifier><identifier>ISBN: 9780769532912</identifier><identifier>EISSN: 2159-3477</identifier><identifier>EISBN: 9780769531700</identifier><identifier>EISBN: 0769531709</identifier><identifier>DOI: 10.1109/ISVLSI.2008.52</identifier><identifier>LCCN: 2008922931</identifier><language>eng</language><publisher>IEEE</publisher><subject>Adaptive algorithm ; Adaptive Routing ; Computer Society ; Congestion Control ; Delay ; Network-on-a-chip ; Network-on-Chip ; Routing ; Silicon ; Stochastic processes ; Topology ; USA Councils ; Very large scale integration</subject><ispartof>2008 IEEE Computer Society Annual Symposium on VLSI, 2008, p.335-340</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4556817$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4556817$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ying-Cherng Lan</creatorcontrib><creatorcontrib>Chen, M.C.</creatorcontrib><creatorcontrib>Su, A.P.</creatorcontrib><creatorcontrib>Yu-Hen Hu</creatorcontrib><creatorcontrib>Sao-Jie Chen</creatorcontrib><title>Flow Maximization for NoC Routing Algorithms</title><title>2008 IEEE Computer Society Annual Symposium on VLSI</title><addtitle>ISVLSI</addtitle><description>In this paper, we apply flow maximization and develop a minimal adaptive routing scheme towards lower average packet latencies in a network-on-chip. The minimal adaptive algorithm allows packets to be forwarded in multiple directions. Typical routing algorithms select the next hop path for each packet and then resolve conflicts between packets that have been selected to have the same next hop path. We propose a novel decision flow which combines routing direction and port arbitration while maximizing flow. Upon a 2-D mesh NoC, our implementation lowers average packet latencies across all packet injection rates of an NoC.</description><subject>Adaptive algorithm</subject><subject>Adaptive Routing</subject><subject>Computer Society</subject><subject>Congestion Control</subject><subject>Delay</subject><subject>Network-on-a-chip</subject><subject>Network-on-Chip</subject><subject>Routing</subject><subject>Silicon</subject><subject>Stochastic processes</subject><subject>Topology</subject><subject>USA Councils</subject><subject>Very large scale integration</subject><issn>2159-3469</issn><issn>2159-3477</issn><isbn>0769532918</isbn><isbn>9780769532912</isbn><isbn>9780769531700</isbn><isbn>0769531709</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9zstOwzAUBFDzqERTumXDJh9AwvW1HdvLqqIQKYBEK7aVG9vFKKlREsTj6ykqYjWLoxkNIRcUckpBX5fL52pZ5gigcoFHZKqlAllowagEOCZjpEJnjEt5QpIDoKbq9B8KPSLJb10jakbPSNL3rwBMUY5jcrVo4kd6bz5DG77NEOIu9bFLH-I8fYrvQ9ht01mzjV0YXtr-nIy8aXo3_csJWS1uVvO7rHq8LeezKgsahswD5QaVKTwzGk2tnBJa8P0DWmPhja2ZVJY5hmABrbWebwwIUHtlYoNsQi4Ps8E5t37rQmu6rzUXolBUsh8VaEdN</recordid><startdate>200804</startdate><enddate>200804</enddate><creator>Ying-Cherng Lan</creator><creator>Chen, M.C.</creator><creator>Su, A.P.</creator><creator>Yu-Hen Hu</creator><creator>Sao-Jie Chen</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200804</creationdate><title>Flow Maximization for NoC Routing Algorithms</title><author>Ying-Cherng Lan ; Chen, M.C. ; Su, A.P. ; Yu-Hen Hu ; Sao-Jie Chen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-f014a28a6f3a92ac8e859540081c26fadc378d3e320d02dddf4ba0508c2635b23</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Adaptive algorithm</topic><topic>Adaptive Routing</topic><topic>Computer Society</topic><topic>Congestion Control</topic><topic>Delay</topic><topic>Network-on-a-chip</topic><topic>Network-on-Chip</topic><topic>Routing</topic><topic>Silicon</topic><topic>Stochastic processes</topic><topic>Topology</topic><topic>USA Councils</topic><topic>Very large scale integration</topic><toplevel>online_resources</toplevel><creatorcontrib>Ying-Cherng Lan</creatorcontrib><creatorcontrib>Chen, M.C.</creatorcontrib><creatorcontrib>Su, A.P.</creatorcontrib><creatorcontrib>Yu-Hen Hu</creatorcontrib><creatorcontrib>Sao-Jie Chen</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ying-Cherng Lan</au><au>Chen, M.C.</au><au>Su, A.P.</au><au>Yu-Hen Hu</au><au>Sao-Jie Chen</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Flow Maximization for NoC Routing Algorithms</atitle><btitle>2008 IEEE Computer Society Annual Symposium on VLSI</btitle><stitle>ISVLSI</stitle><date>2008-04</date><risdate>2008</risdate><spage>335</spage><epage>340</epage><pages>335-340</pages><issn>2159-3469</issn><eissn>2159-3477</eissn><isbn>0769532918</isbn><isbn>9780769532912</isbn><eisbn>9780769531700</eisbn><eisbn>0769531709</eisbn><abstract>In this paper, we apply flow maximization and develop a minimal adaptive routing scheme towards lower average packet latencies in a network-on-chip. The minimal adaptive algorithm allows packets to be forwarded in multiple directions. Typical routing algorithms select the next hop path for each packet and then resolve conflicts between packets that have been selected to have the same next hop path. We propose a novel decision flow which combines routing direction and port arbitration while maximizing flow. Upon a 2-D mesh NoC, our implementation lowers average packet latencies across all packet injection rates of an NoC.</abstract><pub>IEEE</pub><doi>10.1109/ISVLSI.2008.52</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2159-3469 |
| ispartof | 2008 IEEE Computer Society Annual Symposium on VLSI, 2008, p.335-340 |
| issn | 2159-3469 2159-3477 |
| language | eng |
| recordid | cdi_ieee_primary_4556817 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Adaptive algorithm Adaptive Routing Computer Society Congestion Control Delay Network-on-a-chip Network-on-Chip Routing Silicon Stochastic processes Topology USA Councils Very large scale integration |
| title | Flow Maximization for NoC Routing Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T03%3A18%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Flow%20Maximization%20for%20NoC%20Routing%20Algorithms&rft.btitle=2008%20IEEE%20Computer%20Society%20Annual%20Symposium%20on%20VLSI&rft.au=Ying-Cherng%20Lan&rft.date=2008-04&rft.spage=335&rft.epage=340&rft.pages=335-340&rft.issn=2159-3469&rft.eissn=2159-3477&rft.isbn=0769532918&rft.isbn_list=9780769532912&rft_id=info:doi/10.1109/ISVLSI.2008.52&rft_dat=%3Cieee_6IE%3E4556817%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769531700&rft.eisbn_list=0769531709&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4556817&rfr_iscdi=true |