A survey of routing algorithm for mesh Network-on-Chip
详细信息    查看全文
  • 作者:Yue Wu ; Chao Lu ; Yunji Chen
  • 刊名:Frontiers of Computer Science in China
  • 出版年:2016
  • 出版时间:August 2016
  • 年:2016
  • 卷:10
  • 期:4
  • 页码:591-601
  • 全文大小:2,811 KB
  • 刊物类别:Computer Science
  • 刊物主题:Computer Science, general
    Chinese Library of Science
  • 出版者:Higher Education Press, co-published with Springer-Verlag GmbH
  • ISSN:1673-7466
  • 卷排序:10
文摘
With the rapid development of semiconductor industry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Under such background, Network-on-Chip (NoC) is proposed and gradually replacing the traditional on-chip interconnections such as sharing bus and crossbar. For the convenience of physical layout, mesh is the most used topology in NoC design. Routing algorithm, which decides the paths of packets, has significant impact on the latency and throughput of network. Thus routing algorithm plays a vital role in a wellperformed network. This study mainly focuses on the routing algorithms of mesh NoC. By whether taking network information into consideration in routing decision, routing algorithms of NoC can be roughly classified into oblivious routing and adaptive routing. Oblivious routing costs less without adaptiveness while adaptive routing is on the contrary. To combine the advantages of oblivious and adaptive routing algorithm, half-adaptive algorithms were proposed. In this paper, the concepts, taxonomy and features of routing algorithms of NoC are introduced. Then the importance of routing algorithms in mesh NoC is highlighted, and representative routing algorithms with respective features are reviewed and summarized. Finally, we try to shed light upon the future work of NoC routing algorithms.KeywordsNetwork-on-Chipmesh topologyrouting algorithmadaptive routingoblivious routing

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700