Fault Tolerant Unicast Routing Algorithm Based on Parallel Branching Method for Faulty Hypercube
Küçük Resim Yok
Tarih
2001
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this study, an unicast routing algorithm based on the parallel branching method has been developed for the faulty hypercube parallel processing system. The developed method has been compared with the cube algebra method developed by us and with the studies in literature related to this subject. With the developed routing algorithm, the routing from the source node to the destination one is fulfilled in available minimal step without any restriction to the number of faulty nodes. In the algorithm, the system with circuit switching has been considered, and the obtained results have been visually simulated by using the developed hypercube routing simulation program. The performance of simulator has been evaluated by using the comparison the number of the fulfilled process versus the number of faulty nodes for the two method developed by us.
Açıklama
8th IEEE International Conference on Electronics, Circuits and Systems -- SEP 02-05, 2001 -- ST JULIANS, MALTA
Anahtar Kelimeler
Kaynak
Icecs 2001: 8th Ieee International Conference on Electronics, Circuits and Systems, Vols I-iii, Conference Proceedings
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
Sayı
Künye
Güneş, S., Yılmaz, N., Yaldız, E., (2001). Fault Tolerant Unicast Routing Algorithm Based on Parallel Branching Method for Faulty Hypercube. Icecs 2001: 8th Ieee International Conference on Electronics, Circuits and Systems, Vols I-iii, Conference Proceedings, 103-106.
