VALVED ROUTING - EFFICIENT FLOW-CONTROL FOR ADAPTIVE NONMINIMAL ROUTING IN INTERCONNECTION NETWORKS

被引:2
|
作者
LIAO, WK [1 ]
KING, CT [1 ]
机构
[1] NATL TSING HUA UNIV,DEPT COMP SCI,HSINCHU 30043,TAIWAN
关键词
DEADLOCK; FLOW CONTROL; INTERCONNECTION NETWORK; ROUTING ALGORITHM; ROUTER DESIGN; STARVATION;
D O I
10.1109/12.467693
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Adaptive nonminimal routing (or misrouting) may move messages away from their destinations to temporarily cope with the dynamic load in an interconnection network. In most cases, misrouting is more powerful and flexible than minimal routing, especially under nonuniform load distribution. However, to take advantage of its misrouting, we have to avoid deadlock, livelock, and starvation in the network and to maintain the network performance across all levels of loading. In this paper, we propose a new flow control scheme for misrouting, called valved routing. Valved routing controls message injection and transmission through logical valves associated with the router ports. Designing routers using valved routing requires a proper choice of design parameters. We will discuss how to find the range of feasible design parameters, Issues in implementing routers using valved routing will also be addressed. We have conducted extensive simulations to compare the performance of routers with and without valved routing. Our simulation results show that valved routing has promising performance advantages, at light as well as heavy network load. Compared with the voluntary misrouting [15], valved routing performs better in network throughput without sacrificing the latency.
引用
收藏
页码:1181 / 1193
页数:13
相关论文
共 50 条
  • [21] Routing and communication in interconnection networks
    Flammini, M
    Maggs, B
    Sibeyn, BMJ
    Vöcking, B
    EURO-PAR 2002 PARALLEL PROCESSING, PROCEEDINGS, 2002, 2400 : 735 - 735
  • [22] Routing and communication in interconnection networks
    Duato, J
    EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS, 2000, 1900 : 875 - 876
  • [23] Contention-based Nonminimal Adaptive Routing in High-radix Networks
    Fuentes, Pablo
    Vallejo, Enrique
    Garcia, Marina
    Beivide, Ramon
    Rodriguez, German
    Minkenberg, Cyriel
    Valero, Mateo
    2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, : 103 - 112
  • [24] Robust and Efficient Custom Routing for Interconnection Networks with Distributed Shortcuts
    Le Nhat, T. X.
    Nguyen, T. Truong
    Khanh-Van Nguyen
    INTERNATIONAL JOURNAL OF DISTRIBUTED SYSTEMS AND TECHNOLOGIES, 2014, 5 (04) : 51 - 74
  • [25] An Efficient Label Routing on High-Radix Interconnection Networks
    Lei, Fei
    Dong, Dezun
    Liao, Xiangke
    2017 IEEE 23RD INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2017, : 596 - 603
  • [26] The multi-level communication: Efficient routing for interconnection networks
    Hadim, MB
    Sakho, I
    JOURNAL OF SUPERCOMPUTING, 2001, 18 (02): : 153 - 177
  • [27] The Multi-Level Communication: Efficient Routing for Interconnection Networks
    M. B. Hadim
    I. Sakho
    The Journal of Supercomputing, 2001, 18 : 153 - 177
  • [28] An Efficient History-Based Routing Algorithm for Interconnection Networks
    Moosavi, Sanaz Rahimi
    Chang, Chia-Yuan
    Rahmani, Amir-Mohammad
    Plosila, Juha
    Man, Ka Lok
    Jeong, Taikyeong T.
    Lim, Eng Gee
    2012 INTERNATIONAL SOC DESIGN CONFERENCE (ISOCC), 2012, : 277 - 280
  • [29] Efficient Adaptive Routing in Delay Tolerant Networks
    Liu, Cong
    Wu, Jie
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 252 - 256
  • [30] Enhanced control and routing paths in data vortex interconnection networks
    Yang, Qimin
    JOURNAL OF OPTICAL NETWORKING, 2007, 6 (12): : 1314 - 1322