Proportionally-fair best effort flow control in network-on-chip architectures
The research community has recently witnessed the emergence of multi-processor system on chip (MPSoC) platforms consisting of a large set of embedded processors. Particularly, Interconnect networks methodology based on Network-on-Chip (NoC) in MP-SoC design is imminent to achieve high performance po...
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 | 8 |
---|---|
container_issue | |
container_start_page | 1 |
container_title | |
container_volume | |
creator | Talebi, M.S. Jafari, F. Khonsari, A. Yaghmaee, M.H. |
description | The research community has recently witnessed the emergence of multi-processor system on chip (MPSoC) platforms consisting of a large set of embedded processors. Particularly, Interconnect networks methodology based on Network-on-Chip (NoC) in MP-SoC design is imminent to achieve high performance potential. More importantly, many well established schemes of networking and distributed systems inspire NoC design methodologies. Employing end-to-end congestion control is becoming more imminent in the design process of NoCs. This paper presents a centralized congestion scheme in the presence of both elastic and streaming flow traffic mixture. In this paper, we model the desired Best Effort (BE) source rates as the solution to a utility maximization problem which is constrained with link capacities while preserving Guaranteed Service (GS) traffics services requirements at the desired level. We proposed an iterative algorithm as the solution to the maximization problem which has the benefit of low complexity and fast convergence. The proposed algorithm may be implemented by a centralized controller with low computation and communication overhead. |
doi_str_mv | 10.1109/IPDPS.2008.4536499 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>swepub_6IE</sourceid><recordid>TN_cdi_ieee_primary_4536499</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4536499</ieee_id><sourcerecordid>oai_DiVA_org_kth_161078</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1288-ae43ef24d683438009b7152a01f76d2c7fe09701d589fed185d41b1e7109f05c3</originalsourceid><addsrcrecordid>eNpFkFtLw0AQhVdUsNb-AX3JH9g6e0my-1haL4WKBS-vYZPM2rUxGzZbSv-9gRadl8MM3xw4h5BbBlPGQN8v14v125QDqKlMRSa1PiPXTHIpWaalPv9fBFyQEUsFUA55ekUmff8NwwxvXIoReVkH3_kQnW9N0xyoNS4kJfYxQWuHe2Ibv08q38bgm8S1SYtx78OW-pZWG9clJgwSsYq7gP0NubSm6XFy0jH5eHx4nz_T1evTcj5bUce4UtSgFGi5rDMlpFAAusxZyg0wm2c1r3KLoHNgdaq0xZqptJasZJgP2S2klRgTevTt99jtyqIL7seEQ-GNKxbuc1b48FVs46ZgGYNcDfzdkXeI-EefqhO_cgZg6A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Proportionally-fair best effort flow control in network-on-chip architectures</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Talebi, M.S. ; Jafari, F. ; Khonsari, A. ; Yaghmaee, M.H.</creator><creatorcontrib>Talebi, M.S. ; Jafari, F. ; Khonsari, A. ; Yaghmaee, M.H.</creatorcontrib><description>The research community has recently witnessed the emergence of multi-processor system on chip (MPSoC) platforms consisting of a large set of embedded processors. Particularly, Interconnect networks methodology based on Network-on-Chip (NoC) in MP-SoC design is imminent to achieve high performance potential. More importantly, many well established schemes of networking and distributed systems inspire NoC design methodologies. Employing end-to-end congestion control is becoming more imminent in the design process of NoCs. This paper presents a centralized congestion scheme in the presence of both elastic and streaming flow traffic mixture. In this paper, we model the desired Best Effort (BE) source rates as the solution to a utility maximization problem which is constrained with link capacities while preserving Guaranteed Service (GS) traffics services requirements at the desired level. We proposed an iterative algorithm as the solution to the maximization problem which has the benefit of low complexity and fast convergence. The proposed algorithm may be implemented by a centralized controller with low computation and communication overhead.</description><identifier>ISSN: 1530-2075</identifier><identifier>ISBN: 1424416930</identifier><identifier>ISBN: 9781424416936</identifier><identifier>ISBN: 1424416949</identifier><identifier>ISBN: 9781424416943</identifier><identifier>EISBN: 1424416949</identifier><identifier>EISBN: 9781424416943</identifier><identifier>DOI: 10.1109/IPDPS.2008.4536499</identifier><language>eng</language><publisher>IEEE</publisher><subject>Centralized control ; Communication system control ; Communication system traffic control ; Design methodology ; Iterative algorithms ; Network-on-a-chip ; Process design ; Proportional control ; System-on-a-chip ; Traffic control</subject><ispartof>2008 IEEE International Symposium on Parallel and Distributed Processing, 2008, p.1-8</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/4536499$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,885,2056,4047,4048,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4536499$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-161078$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><creatorcontrib>Talebi, M.S.</creatorcontrib><creatorcontrib>Jafari, F.</creatorcontrib><creatorcontrib>Khonsari, A.</creatorcontrib><creatorcontrib>Yaghmaee, M.H.</creatorcontrib><title>Proportionally-fair best effort flow control in network-on-chip architectures</title><title>2008 IEEE International Symposium on Parallel and Distributed Processing</title><addtitle>IPDPS</addtitle><description>The research community has recently witnessed the emergence of multi-processor system on chip (MPSoC) platforms consisting of a large set of embedded processors. Particularly, Interconnect networks methodology based on Network-on-Chip (NoC) in MP-SoC design is imminent to achieve high performance potential. More importantly, many well established schemes of networking and distributed systems inspire NoC design methodologies. Employing end-to-end congestion control is becoming more imminent in the design process of NoCs. This paper presents a centralized congestion scheme in the presence of both elastic and streaming flow traffic mixture. In this paper, we model the desired Best Effort (BE) source rates as the solution to a utility maximization problem which is constrained with link capacities while preserving Guaranteed Service (GS) traffics services requirements at the desired level. We proposed an iterative algorithm as the solution to the maximization problem which has the benefit of low complexity and fast convergence. The proposed algorithm may be implemented by a centralized controller with low computation and communication overhead.</description><subject>Centralized control</subject><subject>Communication system control</subject><subject>Communication system traffic control</subject><subject>Design methodology</subject><subject>Iterative algorithms</subject><subject>Network-on-a-chip</subject><subject>Process design</subject><subject>Proportional control</subject><subject>System-on-a-chip</subject><subject>Traffic control</subject><issn>1530-2075</issn><isbn>1424416930</isbn><isbn>9781424416936</isbn><isbn>1424416949</isbn><isbn>9781424416943</isbn><isbn>1424416949</isbn><isbn>9781424416943</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkFtLw0AQhVdUsNb-AX3JH9g6e0my-1haL4WKBS-vYZPM2rUxGzZbSv-9gRadl8MM3xw4h5BbBlPGQN8v14v125QDqKlMRSa1PiPXTHIpWaalPv9fBFyQEUsFUA55ekUmff8NwwxvXIoReVkH3_kQnW9N0xyoNS4kJfYxQWuHe2Ibv08q38bgm8S1SYtx78OW-pZWG9clJgwSsYq7gP0NubSm6XFy0jH5eHx4nz_T1evTcj5bUce4UtSgFGi5rDMlpFAAusxZyg0wm2c1r3KLoHNgdaq0xZqptJasZJgP2S2klRgTevTt99jtyqIL7seEQ-GNKxbuc1b48FVs46ZgGYNcDfzdkXeI-EefqhO_cgZg6A</recordid><startdate>200804</startdate><enddate>200804</enddate><creator>Talebi, M.S.</creator><creator>Jafari, F.</creator><creator>Khonsari, A.</creator><creator>Yaghmaee, M.H.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>ADTPV</scope><scope>BNKNJ</scope><scope>D8V</scope></search><sort><creationdate>200804</creationdate><title>Proportionally-fair best effort flow control in network-on-chip architectures</title><author>Talebi, M.S. ; Jafari, F. ; Khonsari, A. ; Yaghmaee, M.H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1288-ae43ef24d683438009b7152a01f76d2c7fe09701d589fed185d41b1e7109f05c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Centralized control</topic><topic>Communication system control</topic><topic>Communication system traffic control</topic><topic>Design methodology</topic><topic>Iterative algorithms</topic><topic>Network-on-a-chip</topic><topic>Process design</topic><topic>Proportional control</topic><topic>System-on-a-chip</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Talebi, M.S.</creatorcontrib><creatorcontrib>Jafari, F.</creatorcontrib><creatorcontrib>Khonsari, A.</creatorcontrib><creatorcontrib>Yaghmaee, M.H.</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><collection>SwePub</collection><collection>SwePub Conference</collection><collection>SWEPUB Kungliga Tekniska Högskolan</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Talebi, M.S.</au><au>Jafari, F.</au><au>Khonsari, A.</au><au>Yaghmaee, M.H.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Proportionally-fair best effort flow control in network-on-chip architectures</atitle><btitle>2008 IEEE International Symposium on Parallel and Distributed Processing</btitle><stitle>IPDPS</stitle><date>2008-04</date><risdate>2008</risdate><spage>1</spage><epage>8</epage><pages>1-8</pages><issn>1530-2075</issn><isbn>1424416930</isbn><isbn>9781424416936</isbn><isbn>1424416949</isbn><isbn>9781424416943</isbn><eisbn>1424416949</eisbn><eisbn>9781424416943</eisbn><abstract>The research community has recently witnessed the emergence of multi-processor system on chip (MPSoC) platforms consisting of a large set of embedded processors. Particularly, Interconnect networks methodology based on Network-on-Chip (NoC) in MP-SoC design is imminent to achieve high performance potential. More importantly, many well established schemes of networking and distributed systems inspire NoC design methodologies. Employing end-to-end congestion control is becoming more imminent in the design process of NoCs. This paper presents a centralized congestion scheme in the presence of both elastic and streaming flow traffic mixture. In this paper, we model the desired Best Effort (BE) source rates as the solution to a utility maximization problem which is constrained with link capacities while preserving Guaranteed Service (GS) traffics services requirements at the desired level. We proposed an iterative algorithm as the solution to the maximization problem which has the benefit of low complexity and fast convergence. The proposed algorithm may be implemented by a centralized controller with low computation and communication overhead.</abstract><pub>IEEE</pub><doi>10.1109/IPDPS.2008.4536499</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1530-2075 |
ispartof | 2008 IEEE International Symposium on Parallel and Distributed Processing, 2008, p.1-8 |
issn | 1530-2075 |
language | eng |
recordid | cdi_ieee_primary_4536499 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Centralized control Communication system control Communication system traffic control Design methodology Iterative algorithms Network-on-a-chip Process design Proportional control System-on-a-chip Traffic control |
title | Proportionally-fair best effort flow control in network-on-chip architectures |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T15%3A38%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-swepub_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Proportionally-fair%20best%20effort%20flow%20control%20in%20network-on-chip%20architectures&rft.btitle=2008%20IEEE%20International%20Symposium%20on%20Parallel%20and%20Distributed%20Processing&rft.au=Talebi,%20M.S.&rft.date=2008-04&rft.spage=1&rft.epage=8&rft.pages=1-8&rft.issn=1530-2075&rft.isbn=1424416930&rft.isbn_list=9781424416936&rft.isbn_list=1424416949&rft.isbn_list=9781424416943&rft_id=info:doi/10.1109/IPDPS.2008.4536499&rft_dat=%3Cswepub_6IE%3Eoai_DiVA_org_kth_161078%3C/swepub_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424416949&rft.eisbn_list=9781424416943&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4536499&rfr_iscdi=true |