Fault-Tolerant Multicast Routing Algorithm Based on Cube Algebra for Hypercube Multicomputers
Loading...
Files
Date
2000
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE, Piscataway, NJ, United States
Access Rights
info:eu-repo/semantics/openAccess
Abstract
In this study a broadcast routing algorithm has been developed for faulty hypercube parallel processing system using cube algebra. Without any restriction to the number of the faulty nodes, the routing from the source node to the destination node is implemented minimally. The developed routing algorithm has been visually simulated via prepared data routing simulator program. It has been observed that this algorithm can be applied to various routing problems.
Description
IEEE
10th Mediterranean Electrotechnical Conference (MALECON2000) -- 29 May 2000 through 31 May 2000 -- Lemesos, Cyprus -- 57861
10th Mediterranean Electrotechnical Conference (MALECON2000) -- 29 May 2000 through 31 May 2000 -- Lemesos, Cyprus -- 57861
Keywords
Fault tolerance, multicast routing, cube algebra, subcube allocation
Journal or Series
Proceedings of the Mediterranean Electrotechnical Conference - Melecon
WoS Q Value
Scopus Q Value
N/A
Volume
1
Issue
Citation
Öztürk, A., Yılmaz, N., Güneş, S., (2000). Fault-Tolerant Multicast Routing Algorithm Based on Cube Algebra for Hypercube Multicomputers. Proceedings of the Mediterranean Electrotechnical Conference - Melecon, (1), 107-110.
