首页 | 本学科首页   官方微博 | 高级检索  
     

Reliable Communication on Cube-Based Multicomputers
引用本文:WU Jie. Reliable Communication on Cube-Based Multicomputers[J]. 计算机科学技术学报, 1996, 11(3): 208-221. DOI: 10.1007/BF02943130
作者姓名:WU Jie
作者单位:DepartmentofComputerScienceandEngineering,FloridaAtlanticUniversityBocaRaton,FL33431,U.S.A
摘    要:We consider a distributed unicasting algorithm for hypercubes with faulty nodes(including disconnected hypercubes)using the safety level concept.The safety level of ach node in an n-dimensional hypercube in an approximated measure of the number and distribution of faulty nodes in the neighborhood and it can be easily calculated through n-1 rounds of information exchange among neighboring nodes.Optimal unicasting between two nodes is guaranteed if the safety level of the source node is no less than the Hamming distance between the source and the destination.The feasibility of an optimal or suboptimal unicasting can be easily determined at the source node by comparing its safety level,together with its neighbors‘ safety levels,with the Hamming distance between the source and the destination.The proposed scheme is also the first attempt to address the unicasting problem in discronnected hypercubes.The safety level concept is also extended to be used in hypercubes with both faulty nodes and links and in generalized hypercubes.

关 键 词:计算机 容错 可靠性通信

Reliable communication on cube-based multicomputers
Jie Wu. Reliable communication on cube-based multicomputers[J]. Journal of Computer Science and Technology, 1996, 11(3): 208-221. DOI: 10.1007/BF02943130
Authors:Jie Wu
Affiliation:Department of Computer Science and Engineering; Florida Atlantic UniversityBoca Raton; FL 33431; U.S.A. emai1: Jie@cse.fau.edu;
Abstract:We consider a distributed unicasting algorithm for hypercubes with faulty nodes (including disconnected hypercubes) using the safety level concept. The safety level of each node in an n-dimensional hypercube is an approximated measure of the number and distribution of faulty nodes in the neighborhood and it can be easily calculated through n - 1 rounds of information exchange among neighboring nodes. Optimal unicasting between two nodes is guaranteed if the safety level of the source node is no less than the Hamming distance between the source and the destination. The feasibility of an optimal or suboptimal unicasting can be easily determined at the source node by comparing its safety level, together with its neighbors' safety levels, with the Hamming distance between the source and the destination. The proposed scheme is also the first attempt to address the unicasting problem in disconnected hypercubes. The safety level concept is also extended to be used in hypercubes with both faulty nodes and links and in generalized hypercubes.
Keywords:Reliable communication   hypercube   parallel computer   fault-tolerant
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号