{"id":"https://openalex.org/W26549463","doi":"https://doi.org/10.1109/tvlsi.2016.2556007","title":"Weighted Round Robin Configuration for Worst-Case Delay Optimization in Network-on-Chip","display_name":"Weighted Round Robin Configuration for Worst-Case Delay Optimization in Network-on-Chip","publication_year":2016,"publication_date":"2016-05-24","ids":{"openalex":"https://openalex.org/W26549463","doi":"https://doi.org/10.1109/tvlsi.2016.2556007","mag":"26549463"},"language":"en","primary_location":{"id":"doi:10.1109/tvlsi.2016.2556007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2016.2556007","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041033965","display_name":"Fahimeh Jafari","orcid":"https://orcid.org/0000-0003-3847-3092"},"institutions":[{"id":"https://openalex.org/I44852757","display_name":"Liverpool Hope University","ror":"https://ror.org/03ctjbj91","country_code":"GB","type":"education","lineage":["https://openalex.org/I44852757"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Fahimeh Jafari","raw_affiliation_strings":["Department of Mathematics and Computer Science, Liverpool Hope University, Liverpool, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Liverpool Hope University, Liverpool, U.K","institution_ids":["https://openalex.org/I44852757"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032163732","display_name":"Axel Jantsch","orcid":"https://orcid.org/0000-0003-2251-0004"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Axel Jantsch","raw_affiliation_strings":["Technische Universit\u00e4t Wien, Vienna, Austria","Technische Universit\u00e4t Wien; Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Technische Universit\u00e4t Wien; Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072973899","display_name":"Zhonghai Lu","orcid":"https://orcid.org/0000-0003-0061-3475"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Zhonghai Lu","raw_affiliation_strings":["School of Information and Communication Technology, KTH Royal Institute of Technology, Kista, Sweden"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, KTH Royal Institute of Technology, Kista, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041033965"],"corresponding_institution_ids":["https://openalex.org/I44852757"],"apc_list":null,"apc_paid":null,"fwci":0.5932,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.70974191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"12","first_page":"3387","last_page":"3400"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/elmore-delay","display_name":"Elmore delay","score":0.7956418395042419},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.654208779335022},{"id":"https://openalex.org/keywords/weighted-round-robin","display_name":"Weighted round robin","score":0.6426622271537781},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5573430061340332},{"id":"https://openalex.org/keywords/network-delay","display_name":"Network delay","score":0.5432776212692261},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5210094451904297},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4952622950077057},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.494978129863739},{"id":"https://openalex.org/keywords/network-calculus","display_name":"Network calculus","score":0.47754037380218506},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4638547897338867},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4617491066455841},{"id":"https://openalex.org/keywords/queuing-delay","display_name":"Queuing delay","score":0.4253595173358917},{"id":"https://openalex.org/keywords/delay-calculation","display_name":"Delay calculation","score":0.39017945528030396},{"id":"https://openalex.org/keywords/propagation-delay","display_name":"Propagation delay","score":0.30614081025123596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2598124146461487},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24640068411827087},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.2244563102722168},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.16638973355293274},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.1472654640674591},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.13327810168266296},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11151358485221863}],"concepts":[{"id":"https://openalex.org/C84434228","wikidata":"https://www.wikidata.org/wiki/Q4531332","display_name":"Elmore delay","level":4,"score":0.7956418395042419},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.654208779335022},{"id":"https://openalex.org/C141306801","wikidata":"https://www.wikidata.org/wiki/Q7979905","display_name":"Weighted round robin","level":5,"score":0.6426622271537781},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5573430061340332},{"id":"https://openalex.org/C152623178","wikidata":"https://www.wikidata.org/wiki/Q436417","display_name":"Network delay","level":3,"score":0.5432776212692261},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5210094451904297},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4952622950077057},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.494978129863739},{"id":"https://openalex.org/C2778693205","wikidata":"https://www.wikidata.org/wiki/Q7000967","display_name":"Network calculus","level":3,"score":0.47754037380218506},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4638547897338867},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4617491066455841},{"id":"https://openalex.org/C196095461","wikidata":"https://www.wikidata.org/wiki/Q576842","display_name":"Queuing delay","level":3,"score":0.4253595173358917},{"id":"https://openalex.org/C174086752","wikidata":"https://www.wikidata.org/wiki/Q5253471","display_name":"Delay calculation","level":3,"score":0.39017945528030396},{"id":"https://openalex.org/C90806461","wikidata":"https://www.wikidata.org/wiki/Q1144416","display_name":"Propagation delay","level":2,"score":0.30614081025123596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2598124146461487},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24640068411827087},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.2244563102722168},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.16638973355293274},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.1472654640674591},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.13327810168266296},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11151358485221863},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tvlsi.2016.2556007","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2016.2556007","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-article"},{"id":"pmh:oai:hira.hope.ac.uk:1194","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402035","display_name":"Hope's Institutional Research Archive (Liverpool Hope University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I44852757","host_organization_name":"Liverpool Hope University","host_organization_lineage":["https://openalex.org/I44852757"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:repository.uel.ac.uk:850x2","is_oa":false,"landing_page_url":"https://doi.org/10.1109/TVLSI.2016.2556007","pdf_url":null,"source":{"id":"https://openalex.org/S4306401301","display_name":"UEL Research Repository (University of East London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157227730","host_organization_name":"University of East London","host_organization_lineage":["https://openalex.org/I157227730"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W947728866","https://openalex.org/W1519206895","https://openalex.org/W1542207338","https://openalex.org/W1966253115","https://openalex.org/W1970569299","https://openalex.org/W1972347526","https://openalex.org/W1976297416","https://openalex.org/W1979250340","https://openalex.org/W1982907420","https://openalex.org/W2000110933","https://openalex.org/W2004617458","https://openalex.org/W2009837799","https://openalex.org/W2018622031","https://openalex.org/W2023902395","https://openalex.org/W2034599282","https://openalex.org/W2039172036","https://openalex.org/W2039568841","https://openalex.org/W2043282057","https://openalex.org/W2043375522","https://openalex.org/W2054302810","https://openalex.org/W2068677931","https://openalex.org/W2083594031","https://openalex.org/W2087771945","https://openalex.org/W2094117189","https://openalex.org/W2095795217","https://openalex.org/W2102097772","https://openalex.org/W2102194164","https://openalex.org/W2105208574","https://openalex.org/W2110430598","https://openalex.org/W2110567281","https://openalex.org/W2113615756","https://openalex.org/W2116378308","https://openalex.org/W2118162262","https://openalex.org/W2118231264","https://openalex.org/W2119476394","https://openalex.org/W2131201790","https://openalex.org/W2134049183","https://openalex.org/W2141273270","https://openalex.org/W2147206873","https://openalex.org/W2158118666","https://openalex.org/W2160905839","https://openalex.org/W2171121617","https://openalex.org/W2292188910","https://openalex.org/W3139679017","https://openalex.org/W4229831042","https://openalex.org/W4234308027","https://openalex.org/W4246144578"],"related_works":["https://openalex.org/W2114232017","https://openalex.org/W2020200124","https://openalex.org/W1691923927","https://openalex.org/W3134825382","https://openalex.org/W2146452824","https://openalex.org/W2380365775","https://openalex.org/W4238419543","https://openalex.org/W2592965047","https://openalex.org/W77573491","https://openalex.org/W2364986712"],"abstract_inverted_index":{"We":[0,88,171],"propose":[1],"an":[2,16,174],"approach":[3],"for":[4,47,183],"computing":[5,48],"the":[6,55,59,74,81,85,104,112,136,146,167,184],"end-to-end":[7,42],"delay":[8,51,70,92,106,185],"bound":[9],"of":[10,54,135,148,166],"individual":[11,56],"variable":[12],"bit-rate":[13],"flows":[14],"in":[15,76,187],"First":[17,19],"Input":[18],"Output":[20],"multiplexer":[21],"with":[22,68,152],"aggregate":[23],"scheduling":[24],"under":[25],"weighted":[26],"round":[27,153],"robin":[28,154],"(WRR)":[29],"policy.":[30,155],"To":[31],"this":[32],"end,":[33],"we":[34,72],"use":[35],"a":[36,121,132,142,180],"network":[37,189],"calculus":[38],"to":[39,64,79],"derive":[40],"per-flow":[41],"equivalent":[43],"service":[44],"curves":[45],"employed":[46],"least":[49],"upper":[50],"bounds":[52,107],"(LUDBs)":[53],"flows.":[57],"Since":[58],"real-time":[60],"applications":[61],"are":[62,118],"going":[63],"meet":[65],"guaranteed":[66],"services":[67],"lower":[69],"bounds,":[71],"optimize":[73],"weights":[75],"WRR":[77],"policy":[78],"minimize":[80],"LUDBs":[82],"while":[83],"satisfying":[84],"performance":[86],"constraints.":[87],"formulate":[89],"two":[90],"constrained":[91],"optimization":[93,101,157,186],"problems,":[94],"namely,":[95],"minimize-delay":[96],"and":[97,108,141],"multiobjective":[98],"optimization.":[99],"Multiobjective":[100],"has":[102,159],"both":[103],"total":[105,137],"their":[109],"variance":[110,147],"as":[111],"minimization":[113],"objectives.":[114],"The":[115,156],"proposed":[116],"optimizations":[117],"solved":[119],"using":[120],"genetic":[122],"algorithm.":[123],"A":[124],"video":[125],"object":[126],"plane":[127],"decoder":[128],"case":[129,139],"study":[130],"exhibits":[131],"15.4%":[133],"reduction":[134,144],"worst":[138],"delays":[140,149],"40.3%":[143],"on":[145],"when":[150],"compared":[151],"algorithm":[158],"low":[160],"run-time":[161],"complexity,":[162],"enabling":[163],"quick":[164],"exploration":[165],"large":[168],"design":[169],"spaces.":[170],"conclude":[172],"that":[173],"appropriate":[175],"weight":[176],"allocation":[177],"can":[178],"be":[179],"valuable":[181],"instrument":[182],"on-chip":[188],"designs.":[190]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}