Analysis of k-ary n-cubes with dimension-ordered routing

被引：7
|
作者：
Sarbazi-Azad, H [1 ]
Khonsari, A
Ould-Khaoua, M
机构：
[1] Sharif Univ Technol, Dept Comp Engn, Tehran, Iran
[2] Univ Glasgow, Dept Comp Sci, Glasgow G12 8RZ, Lanark, Scotland
来源：
FUTURE GENERATION COMPUTER SYSTEMS | 2003年 / 19卷 / 04期
关键词：
multicomputer networks; dimension-ordered routing; virtual channel multiplexing; message latency; M/G/1 queuing systems;
D O I：
10.1016/S0167-739X(02)00125-5
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
K-ary n-cubes have been one of the most popular interconnection networks for practical multicomputers due to their ease of implementation and ability to exploit communication locality found in many parallel applications. This paper describes an analytical model for k-ary n-cubes with dimension-ordered routing. The main feature of the model is its ability to captures network performance when an arbitrary number of virtual channels are used to reduce message blocking. Simulation experiments reveal that the latency results predicted by the analytical model are in good agreement with those provided by the simulation model. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：493 / 502
页数：10
相关论文
共 50 条
  • [1] Balanced Dimension-Order Routing for k-ary n-cubes
    Miguel Montanana, Jose
    Koibuchi, Michihiro
    Matsutani, Hiroki
    Amano, Hideharu
    [J]. 2009 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS (ICPPW 2009), 2009, : 499 - +
  • [2] Adaptive wormhole routing in k-ary n-cubes
    Yang, CS
    Tsai, YM
    Chi, SL
    Shi, SSB
    [J]. PARALLEL COMPUTING, 1995, 21 (12) : 1925 - 1943
  • [3] Performance analysis of k-ary n-cubes with fully adaptive routing
    Sarbazi-Azad, H
    Ould-Khaoua, M
    Mackenzie, LM
    [J]. SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2000, : 249 - 255
  • [4] Analysis of deterministic routing in k-ary n-cubes with virtual channels
    Sarbazi-Azad, H
    Khonsari, A
    Ould-Khaoua, M
    [J]. PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, : 509 - 516
  • [5] Increasing the adaptivity of routing algorithms for k-ary n-cubes
    Baydal, E
    López, P
    Duato, J
    [J]. 10TH EUROMICRO WORKSHOP ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2002, : 455 - 462
  • [6] Augmented k-ary n-cubes
    Xiang, Yonghong
    Stewart, Iain A.
    [J]. INFORMATION SCIENCES, 2011, 181 (01) : 239 - 256
  • [7] Subnetwork reliability analysis in k-ary n-cubes
    Feng, Kai
    Ji, Zhangjian
    Wei, Wei
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 267 : 85 - 92
  • [8] ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES
    Stewart, Iain A.
    [J]. PARALLEL PROCESSING LETTERS, 2012, 22 (01)
  • [9] Routing in bidirectional k-ary n-cubes with the Red Rover algorithm
    Draper, J
    Petrini, F
    [J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1184 - 1193
  • [10] Bipanconnectivity and Bipancyclicity in k-ary n-cubes
    Stewart, Iain A.
    Xiang, Yonghong
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (01) : 25 - 33
12345