A performance model for Duato's fully adaptive routing algorithm in k-ary n-cubes

被引：62
作者：
Ould-Khaoua, M [1 ]
机构：
[1] Univ Strathclyde, Dept Comp Sci, Glasgow G1 1XH, Lanark, Scotland
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1999年 / 48卷 / 12期
关键词：
multicomputers; interconnection networks; adaptive routing; deterministic routing; virtual channels; message latency; performance modeling;
D O I：
10.1109/12.817384
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
引用
收藏
页码：1297 / 1304
页数：8
相关论文
共 50 条
  • [31] Embedding long paths in k-ary n-cubes with faulty nodes and links
    Stewart, Iain A.
    Xiang, Yonghong
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (08) : 1071 - 1085
  • [32] Hamiltonian cycles passing through linear forests in k-ary n-cubes
    Wang, Shiying
    Yang, Yuxing
    Li, Jing
    Lin, Shangwei
    [J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (14) : 1425 - 1435
  • [33] Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
    Li, Jing
    Wang, Shiying
    Liu, Di
    Lin, Shangwei
    [J]. INFORMATION SCIENCES, 2011, 181 (11) : 2260 - 2267
  • [34] Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
    Lin, Shangwei
    Wang, Shiying
    Li, Chunfang
    [J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (04) : 212 - 223
  • [35] Many-to-many disjoint path covers in k-ary n-cubes
    Zhang, Shurong
    Wang, Shiying
    [J]. THEORETICAL COMPUTER SCIENCE, 2013, 491 : 103 - 118
  • [36] A queueing model for predicting message latency in uni-directional k-ary n-cubes with deterministic routing and non-uniform traffic
    Loucif, Samia
    Khaoua, Mohamed Ould
    Min, Geyong
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2007, 10 (02): : 229 - 239
  • [37] A queueing model for predicting message latency in uni-directional k-ary n-cubes with deterministic routing and non-uniform traffic
    Samia Loucif
    Mohamed Ould Khaoua
    Geyong Min
    [J]. Cluster Computing, 2007, 10 (2) : 229 - 239
  • [38] Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption
    Xiang, Yonghong
    Stewart, Iain A.
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (09) : 1506 - 1513
  • [39] Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
    Wang, Shiying
    Li, Jing
    Lin, Shangwei
    Wang, Ruixia
    [J]. INFORMATION AND COMPUTATION, 2013, 230 : 55 - 66
  • [40] A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS
    Khonsari, A.
    Shahrabi, A.
    Ould-Khaoua, M.
    [J]. PARALLEL PROCESSING LETTERS, 2007, 17 (02) : 213 - 228
12345