The algorithm is simulated with a hypercube routing simulator.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this study, a multicast routing algorithm based on parallel branching method has been developed for a faulty hypercube parallel processing system.
📊
Key Findings & Data:The routing from the source to the destination nodes is guaranteed in shortest time with this algorithm.
💡
Conclusion & Impact:The algorithm is simulated with a hypercube routing simulator.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Abstract
In this study, a multicast routing algorithm based on parallel branching method has been developed for a faulty hypercube parallel processing system. The routing from the source to the destination nodes is guaranteed in shortest time with this algorithm. Going through to the destinations from the source is a parallel process at each step. The superiority of the developed algorithm over the previous studies is that the routing from the source to the destination is achieved in minimal step without restriction to the number of faulty nodes. This means that the algorithm is running independent from the number of the faulty nodes. The algorithm is simulated with a hypercube routing simulator.
🔖
Cite This Article
GÜNEŞ, S., ALLAHVERDİ, N., YILMAZ, N. (2022). A multicast routing algorithm based on parallel branching method for faulty hypercubes. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 2 - Sayı: 2, 477–481. https://ajindex.com/articles/543934
Abali, B, Özgüner, F. and Aykanat, C. “Dynamic Subcube Allocation in Hypercube Multiprocessor”, The Proceedings of the Fourth Conference on Hypercubes Concurrent Computers and Applications, pp.269-272, 1989
Allahverdi, N.M., et all. “A Fault Tolerant Routing Algorithm Based on Cube Algebra for Hypercube Systems”. Journal of Systems Architecture (JSA). Vol.46, Iss.2 (January), pp.201-205, 2000
Burch, H. J. and Ercal, F. “A Fast Algorithm for Complete Subcube Recognition”, Proceedings of the 1997 Int. Symp. On Parallel Architectures, Algorithms and Networks, 85-90, 1997
Chan, M.Y. and Lee, S.J. “Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes”. IEEE Transactions on Parallel Distributed Systems. Vol.4, No:3, pp.277-288, 1993
Chang, Y. and Bhuyan L. “Subcube Fault Tolerance in Hypercube Multicomputers”. IEEE Transactions on Comput. Vol.44, No:9, pp.1108-1120, 1995
Chen, M.S. and Shin, K.G. “Dept-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers”. IEEE Transactions on Parallel Distributed Systems. Vol.1, No:2, pp.152-159, 1990. [7]Chiu, G.M. and Wu, S.P. “A Fault-Tolerant Routing Strategy in Hypercube Multicomputers”. IEEE Transactions on Comput. Vol.45, No:2, pp.143-155, 1996
Duato, J., Yalamachili, S. and Ni, L. “Interconnection Networks”. IEEE Computer Society Press, Piscataway, 1997
Güneş, S. et all. “Simulation of New Fast Algorithm Basaed on Cube Algebra for Subcube Allocation in Faulty Hypercubes”. Proc. of The Second Int. Symp. on Math. & Com. Appl, Baku, pp.169-175, 1999
Güneº, S. et all. “Realization of Nonminimal Routing Algorithm in Faulty Hypercube Parallel Processing System With Using Cube Algebra”. ELECO’99, pp.290-293, 1999
Lan, Y. “An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers”. IEEE Transactions on Parallel and Distributed Systems. Vol.6, No:11, pp.147-1152, 1995
Lee, T.C. and Hayes, J.P. “A Fault-Tolerant Communication Scheme for Hypercube Computers”. IEEE Transactions on Computers. Vol.41, No:10, pp.1242-1256, 1992
Saad, Y. and Schultz, M. H. “Topological Properties of Hypercubes”. IEEE Transactions on Computers. Vol.C-37, No:7, pp.867-872, 1988
Raghavendra, C.S., Yang, P.J. and Tien, S.B. “Free-Dimensions An Approach to Achieving Fault Tolerance in Hypercube”. IEEE Transactions on Computers. Vol.44, No:9, pp.1152-1156
Tien, S.B. and Raghavendra, C.S. “Algorithms and Bounds for Shortest Paths Dia