RARR: Reverse Anchored Round-Robin for Link Scheduling in Network-on-Chip
As a packet is distributed along its path in a wormhole Network-on-Chip (NoC),the individual link schedulers can hardly fulfill packet-based allocation without synchronization,to achieve lower average latency than flit-based one does. Reverse Anchored Round-Robin (RARR) is proposed as hybrid of flit and packet based schemes. The unique highest-priority fragment is reserved as anchor at each link and RARR attempts to synchronize by anchoring all fragments belong to the same packet. If done,the packet may be delivered continuously,i.e. at packet-level. Otherwise flit-based allocation is employed to ensure link utility and get rid of starvation. Inspired by Anchored Round-Robin (ARR),RARR employs more deterministic anchoring scheme and eliminates deadlock in it.Popular Round-Robins were evaluated on a cycleaccurate simulator. RARR was shown to achieve the lowest average latency among the candidates,and outperform FFRR by more than 10％ consistently.
Zhe Zhang Xiaopeng Gao Xiang Long
School of Computer Science and Engineering Beihang University,Beijing,P.R.China
国际会议
成都
英文
318-323
2008-01-01（万方平台首次上网日期，不代表论文的发表时间）