Destination-Based Congestion Awareness for Adaptive Routing in 2D Mesh Networks

被引:3
|
作者
Ramanujam, Rohit Sunkam [1 ]
Lin, Bill [1 ]
机构
[1] Univ Calif San Diego, Elect & Comp Engn Dept, San Diego, CA 92103 USA
关键词
Algorithms; Design; On-chip networks; adaptive routing;
D O I
10.1145/2505055
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The choice of routing algorithm plays a vital role in the performance of on-chip interconnection networks. Adaptive routing is appealing because it offers better latency and throughput than oblivious routing, especially under nonuniform and bursty traffic. The performance of an adaptive routing algorithm is determined by its ability to accurately estimate congestion in the network. In this regard, maintaining global congestion state using a separate monitoring network offers better congestion visibility into distant parts of the network compared to solutions relying only on local congestion. However, the main challenge in designing such routing schemes is to keep the logic and bandwidth overhead as low as possible to fit into the tight power, area, and delay budgets of on-chip routers. In this article, we propose a minimal destination-based adaptive routing strategy (DAR), where every node estimates the delay to every other node in the network, and routing decisions are based on these per-destination delay estimates. DAR outperforms Regional Congestion Awareness (RCA), the best previously known adaptive routing algorithm that uses nonlocal congestion state. The performance improvement is brought about by maintaining fine-grained per-destination delay estimates in DAR that are more accurate than regional congestion metrics measured in RCA. The increased accuracy is a consequence of the fact that the per-destination delay estimates are not corrupted by congestion on links outside the admissible routing paths to the destination. A scalable version of DAR, referred to as SDAR, is also proposed for minimizing the overheads associated with DAR in large network topologies. We show that DAR outperforms local adaptive routing by up to 79% and RCA by up to 58% in terms of latency on SPLASH-2 benchmarks. DAR and SDAR also outperform existing adaptive and oblivious routing algorithms in latency and throughput under synthetic traffic patterns on 8x8 and 16x16 mesh topologies, respectively.
引用
收藏
页数:27
相关论文
共 50 条
  • [1] Congestion-aware adaptive routing in 2D mesh multicores
    Avresky, Dimiter
    Chaix, Fabien
    Nicolaidis, Michael
    [J]. 2014 IEEE 13TH INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA 2014), 2014, : 50 - 58
  • [2] Hybrid adaptive routing algorithm for 2D Mesh On-Chip Networks
    Krishnan, Gogula S.
    Inbarasan, T.
    Chitra, P.
    [J]. 2017 IEEE 3RD INTERNATIONAL CONFERENCE ON SENSING, SIGNAL PROCESSING AND SECURITY (ICSSS), 2017, : 284 - 289
  • [3] Load Balancing in IP Networks Using Generalized Destination-Based Multipath Routing
    Zhang, Junjie
    Xi, Kang
    Chao, H. Jonathan
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (06) : 1959 - 1969
  • [4] ADAPTIVE MULTICAST WORMHOLE ROUTING IN 2D MESH MULTICOMPUTERS
    LIN, XL
    MCKINLEY, PK
    ESFAHANIAN, AH
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 28 (01) : 19 - 31
  • [5] PAAD (Partially adaptive and deterministic routing): A deadlock free congestion aware hybrid routing for 2D mesh network-on-chips.
    Manzoor, Misbah
    Mir, Roohie Naaz
    Hakim, Najeeb-ud-din
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2022, 92
  • [6] Value of Time Clustering and the Efficiency of Destination-Based Congestion Pricing
    Harris, Jorgen
    Shaikh, Sabina L.
    [J]. ENVIRONMENTAL PRACTICE, 2011, 13 (01) : 28 - 37
  • [7] Fault-tolerant adaptive wormhole routing in 2D mesh
    Kim, SP
    Han, T
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1998, E81D (10): : 1064 - 1071
  • [8] Fault-tolerant and Congestion Balanced Routing Algorithm for 2D Mesh NoCs
    Guan, Jiao
    Cai, Jueping
    Wang, Yequn
    Liu, Jian
    [J]. JOURNAL OF WEB ENGINEERING, 2020, 19 (7-8): : 1049 - 1066
  • [9] ADAPTIVE ROUTING IN MESH NETWORKS
    GREENBERG, AG
    GOODMAN, J
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1986, 12 (01): : 64 - 64
  • [10] The Hamiltonian-based odd-even turn model for maximally adaptive routing in 2D mesh networks-on-chip
    Bahrebar, Poona
    Stroobandt, Dirk
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2015, 45 : 386 - 401