摘要
Wormhole-switching is usually employed in the emerging network-on-chip (NoC), in which the link scheduler can hardly guarantee the packet-level latency. Reverse anchored round-robin (RARR) is proposed as hybrid of the flit-by-flit round-robin (FFRR) and the packet-by-packet round-robin (PPRR). In the scheme of RARR, before the head flits have arrived at the destination, the packets are forwarded flit by flit. Then the scheduler at the destination link starts attempting to mark all fragments of the packet as anchors, which is accomplished by requesting and scheduling following the path reversely and hop by hop. The anchored packet takes priority over others, and will be scheduled at packet level. Others will be scheduled flit by flit only if the anchored one breaks. The RARR is inspired by the anchored round-robin (ARR), but employs more determinate anchoring scheme and eliminates the deadlock in ARR. Familiar round-robin were quantified via a cycle-accurate wormhole network simulator, including FFRR, PPRR, ARR and RARR. The RARR was shown to be most efficient among them.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 930-934 |
| 页数 | 5 |
| 期刊 | Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics |
| 卷 | 34 |
| 期 | 8 |
| 出版状态 | 已出版 - 8月 2008 |
指纹
探究 'Link scheduler for network-on-chip' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver