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 条

[41] Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges [J].

Xiang, Yonghong ;

Stewart, Iain ;

Madelaine, Florent .

2011 IEEE 17TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2011, :181-187

[42] Analytical modelling of wormhole-routed k-ary n-cubes in the presence of matrix-transpose traffic [J].

Sarbazi-Azad, H ;

Ould-Khaoua, M ;

Mackenzie, LM .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2003, 63 (04) :396-409

[43] Embedding Hamiltonian Paths in k-Ary n-Cubes With Exponentially-Many Faulty Edges [J].

Zhuang, Hongbin ;

Li, Xiao-Yan ;

Chang, Jou-Ming ;

Lin, Cheng-Kuan ;

Liu, Ximeng .

IEEE TRANSACTIONS ON COMPUTERS, 2023, 72 (11) :3245-3258

[44] Adaptive routing in k-ary n-cube multicomputers [J].

Yang, CS ;

Tsai, YM ;

Tsai, YL .

1996 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1996, :404-411

[45] A performance model of true fully adaptive routing in hypercubes [J].

Khonsari, A ;

Sarbazi-Azad, H ;

Ould-Khaoua, A .

HIGH PERFORMANCE COMPUTING SYSTEMS AND APPLICATIONS, 2003, 727 :87-101

[46] Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model [J].

Zhuang, Hongbin ;

Li, Xiao-Yan ;

Chang, Jou-Ming ;

Liu, Ximeng .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2024, 190

[47] EXPRESS CUBES - IMPROVING THE PERFORMANCE OF K-ARY N-CUBE INTERCONNECTION NETWORKS [J].

DALLY, WJ .

IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (09) :1016-1023

[48] Hamiltonian Paths of k-ary n-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests [J].

Yang, Yuxing ;

Zhang, Lingling .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2022, 33 (07) :1752-1760

[49] A novel routing algorithm for k-ary n-cube interconnection networks [J].

Demaine, ED ;

Srinivas, S .

INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1996, 8 (01) :81-92

[50] Fault-Free Hamiltonian Cycles Passing through Prescribed Edges in k-Ary n-Cubes with Faulty Edges [J].

Zhang, Shurong ;

Zhang, Xianwen .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (02) :434-443

← 1 2 3 4 5 →