The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dalam makalah ini, kami mencadangkan algoritma multicast toleran kesalahan baru untuk hiperkiub yang disalurkan lubang cacing n-dimensi. Algoritma multicast akan kekal berfungsi jika bilangan nod yang rosak dalam n-hiperkubus dimensi kurang daripada n. Multicast ialah penghantaran mesej yang sama dari satu nod sumber kepada nombor arbitrari nod destinasi. Baru-baru ini, penghalaan lubang cacing telah menjadi salah satu teknik pensuisan yang paling popular dalam multikomputer generasi baharu. Penyelidikan sebelum ini telah memfokuskan pada algoritma penghalaan satu-ke-satu yang bertoleransi kesalahan untuk n-jaringan dimensi. Walau bagaimanapun, sedikit kajian telah dilakukan ke atas algoritma penghalaan satu-ke-banyak (berbilang siaran) bertoleransi kesalahan kerana kesukaran untuk mencapai penghalaan tanpa kebuntuan pada rangkaian yang rosak. Kami akan membangunkan algoritma sedemikian untuk hiperkubus yang rosak. Pendekatan kami tidak berdasarkan menambah saluran fizikal atau maya pada topologi rangkaian. Sebaliknya, kami menyepadukan beberapa teknik seperti pembahagian nod, pembahagian saluran, penetapan label nod dan multicast dwi laluan untuk mencapai toleransi kesalahan. Kedua-dua analisis teori dan simulasi dilakukan untuk menunjukkan keberkesanan algoritma yang dicadangkan.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Shih-Chang WANG, Jeng-Ping LIN, Sy-Yen KUO, "A Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 3, pp. 677-686, March 1999, doi: .
Abstract: In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of the most popular switching techniques in new generation multicomputers. Previous researches have focused on fault-tolerant one-to-one routing algorithms for n-dimensional meshes. However, little research has been done on fault-tolerant one-to-many (multicast) routing algorithms due to the difficulty in achieving deadlock-free routing on faulty networks. We will develop such an algorithm for faulty hypercubes. Our approach is not based on adding physical or virtual channels to the network topology. Instead, we integrate several techniques such as partitioning of nodes, partitioning of channels, node label assignments, and dual-path multicast to achieve fault tolerance. Both theoretical analysis and simulation are performed to demonstrate the effectiveness of the proposed algorithm.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_3_677/_p
Salinan
@ARTICLE{e82-d_3_677,
author={Shih-Chang WANG, Jeng-Ping LIN, Sy-Yen KUO, },
journal={IEICE TRANSACTIONS on Information},
title={A Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes},
year={1999},
volume={E82-D},
number={3},
pages={677-686},
abstract={In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of the most popular switching techniques in new generation multicomputers. Previous researches have focused on fault-tolerant one-to-one routing algorithms for n-dimensional meshes. However, little research has been done on fault-tolerant one-to-many (multicast) routing algorithms due to the difficulty in achieving deadlock-free routing on faulty networks. We will develop such an algorithm for faulty hypercubes. Our approach is not based on adding physical or virtual channels to the network topology. Instead, we integrate several techniques such as partitioning of nodes, partitioning of channels, node label assignments, and dual-path multicast to achieve fault tolerance. Both theoretical analysis and simulation are performed to demonstrate the effectiveness of the proposed algorithm.},
keywords={},
doi={},
ISSN={},
month={March},}
Salinan
TY - JOUR
TI - A Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes
T2 - IEICE TRANSACTIONS on Information
SP - 677
EP - 686
AU - Shih-Chang WANG
AU - Jeng-Ping LIN
AU - Sy-Yen KUO
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1999
AB - In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of the most popular switching techniques in new generation multicomputers. Previous researches have focused on fault-tolerant one-to-one routing algorithms for n-dimensional meshes. However, little research has been done on fault-tolerant one-to-many (multicast) routing algorithms due to the difficulty in achieving deadlock-free routing on faulty networks. We will develop such an algorithm for faulty hypercubes. Our approach is not based on adding physical or virtual channels to the network topology. Instead, we integrate several techniques such as partitioning of nodes, partitioning of channels, node label assignments, and dual-path multicast to achieve fault tolerance. Both theoretical analysis and simulation are performed to demonstrate the effectiveness of the proposed algorithm.
ER -