%0 Conference Paper %1 Li18ITC30 %A Li, Zhenmin %A Fan, Renshi %A Gaoming, Du %A Cao, Yifan %A Lu, Zhonghai %A Minglun, Gao %B 30th International Teletraffic Congress (ITC 30) %C Vienna, Austria %D 2018 %K Session_3.2:_Madness_Session itc itc30 %T RB-OLITS: A Worst-Case Reorder Buffer Size Reduction Method for 3D-NoC Based on Ohm's Law-Like Traffic Splitting %U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc30/Li18ITC30.pdf?inline=true %X Higher link bandwidth provided by three-dimensional Network-on-Chip (3D-NoC) relies on multi-path routing and traffic splitting, which inevitably leads to out-of-order packet delivery problem when facing unbalanced traffic congestion. Therefore, a reordering mechanism, often requiring reorder buffers, is necessary to guarantee in-order delivery of packets. The reorder buffers are expensive in terms of both resource and power consumption, hence it is of great significance to reduce the reorder buffer size in the worst case. In this paper, we propose a improved Ohm's Law-like traffic splitting method, named RB-OLITS, for reducing the worst-case reorder buffer size. The traffic splitting configuration is obtained according to the parallel resistance theory. Experimental results show that RB-OLITS has reduced the worst-case reorder buffer size by 19.09% in average compared with OLITS. Meanwhile, the worst-case delay bound is not degraded by using RB-OLITS, as the worst-case delay bound of the same target flow is slightly improved by 1.59% in average.

@inproceedings{Li18ITC30, abstract = {Higher link bandwidth provided by three-dimensional Network-on-Chip (3D-NoC) relies on multi-path routing and traffic splitting, which inevitably leads to out-of-order packet delivery problem when facing unbalanced traffic congestion. Therefore, a reordering mechanism, often requiring reorder buffers, is necessary to guarantee in-order delivery of packets. The reorder buffers are expensive in terms of both resource and power consumption, hence it is of great significance to reduce the reorder buffer size in the worst case. In this paper, we propose a improved Ohm's Law-like traffic splitting method, named RB-OLITS, for reducing the worst-case reorder buffer size. The traffic splitting configuration is obtained according to the parallel resistance theory. Experimental results show that RB-OLITS has reduced the worst-case reorder buffer size by 19.09% in average compared with OLITS. Meanwhile, the worst-case delay bound is not degraded by using RB-OLITS, as the worst-case delay bound of the same target flow is slightly improved by 1.59% in average.}, added-at = {2018-09-12T17:41:00.000+0200}, address = {Vienna, Austria}, author = {Li, Zhenmin and Fan, Renshi and Gaoming, Du and Cao, Yifan and Lu, Zhonghai and Minglun, Gao}, biburl = {https://www.bibsonomy.org/bibtex/275cdb050e53cdfcebabce0d8d528e685/itc}, booktitle = {30th International Teletraffic Congress (ITC 30)}, interhash = {2d8e43fcb215c845a30e87b588bd250e}, intrahash = {75cdb050e53cdfcebabce0d8d528e685}, keywords = {Session_3.2:_Madness_Session itc itc30}, timestamp = {2020-05-24T20:14:34.000+0200}, title = {RB-OLITS: A Worst-Case Reorder Buffer Size Reduction Method for 3D-NoC Based on Ohm's Law-Like Traffic Splitting}, url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc30/Li18ITC30.pdf?inline=true}, year = 2018 }