Fault-tolerant routing based on approximate directed routable probabilities for hypercubes

被引：13
作者：
Dinh Thuy Duong [1 ]
Kaneko, Keiichi [1 ]
机构：
[1] Tokyo Univ Agr & Technol, Grad Sch Engn, Dept Comp & Informat Sci, Tokyo, Japan
来源：
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2014年 / 37卷
基金：
日本学术振兴会;
关键词：
Multicomputer; Interconnection network; Parallel processing; Fault-tolerant routing; Hypercube; Performance evaluation;
D O I：
10.1016/j.future.2013.12.003
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Recently, parallel processing systems have been studied very actively, and many topologies have been proposed. A hypercube is one of the most popular topologies for interconnection networks. In this paper, we propose two new fault-tolerant routing algorithms for hypercubes based on approximate directed routable probabilities. Probabilities represent the ability of routing toward any node located at a specific distance and are calculated by considering from which direction the message has been received. Each node chooses one of its neighbor nodes to forward the message by comparing the approximate directed routable probabilities. We also conducted a computer experiment to verify the effectiveness of our algorithms. (C) 2014 Elsevier B.V. All rights
引用
收藏
页码：88 / 96
页数：9
相关论文
共 10 条
1