Performance evaluation of fully adaptive wormhole routing including selection function choice

被引：0
|
作者：
Schwiebert, Loren [1 ]
机构：
[1] Wayne State Univ, Detroit, United States
来源：
IEEE International Performance, Computing and Communications Conference, Proceedings | 2000年
关键词：
Adaptive algorithms - Computer simulation - Congestion control (communication) - Telecommunication traffic;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the selection function affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for four different fully adaptive wormhole routing algorithms for 2D meshes. The simulation results show that the choice of selection function has a significant effect on the average message latency and saturation behavior. In fact, it appears that changing the selection function can have a greater effect than changing the routing algorithm. In addition, the best selection function for one adaptive routing algorithm may not be the best choice for another adaptive routing algorithm. An explanation and interpretation of the results is provided.
引用
收藏
页码：117 / 123
相关论文
共 50 条
  • [21] Performance modelling of a true fully adaptive routing algorithm
    Khonsari, A
    Sarbazi-Azad, H
    Ould-Khaoua, M
    PROCEEDINGS OF THE 2001 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2001, : 393 - 400
  • [22] A performance model of true fully adaptive routing in hypercubes
    Khonsari, A
    Sarbazi-Azad, H
    Ould-Khaoua, A
    HIGH PERFORMANCE COMPUTING SYSTEMS AND APPLICATIONS, 2003, 727 : 87 - 101
  • [23] Performance analysis of wormhole switching with adaptive routing in a two-dimensional torus
    Colajanni, M
    Ciciani, B
    Quaglia, F
    EURO-PAR'99: PARALLEL PROCESSING, 1999, 1685 : 165 - 172
  • [24] MMLRU selection function: a simple and efficient output selection function in adaptive routing
    Koibuchi, M
    Jouraku, A
    Amano, H
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (01): : 109 - 118
  • [25] Performance Modelling of Fully Adaptive Wormhole Routing in 2D-Mesh Network-on-Chip with MMPP (2) Input Traffic
    Li, Yonghui
    Gu, Huaxi
    Xie, Peibo
    He, Keqiang
    ISISE 2008: INTERNATIONAL SYMPOSIUM ON INFORMATION SCIENCE AND ENGINEERING, VOL 2, 2008, : 58 - +
  • [26] Performance evaluation of fully adaptive routing under different workloads and constant node buffer size
    Rezazad, M
    Sarbazi-Azad, H
    11th International Conference on Parallel and Distributed Systems Workshops, Vol II, Proceedings,, 2005, : 510 - 514
  • [27] Analytic performance modeling of a fully adaptive routing algorithm in the torus
    Rezazad, M
    Sarbazi-azad, H
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, 2005, 3758 : 984 - 989
  • [28] Performance analysis of minimal adaptive wormhole routing with time-dependent deadlock recovery
    Petrini, F
    Vanneschi, M
    11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 589 - 595
  • [29] Performance Evaluation of Cross Link Fully Adaptive Routing Algorithm with Cross Link Architecture for Network on Chip
    Mahar, Rohit
    Choudhary, Sudhanshu
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INVENTIVE COMPUTING AND INFORMATICS (ICICI 2017), 2017, : 576 - 583
  • [30] Framework for designing high performance fully-adaptive routing algorithms
    Deng, Bo
    Yang, Xiaodong
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2000, 37 (05): : 527 - 531
12345