Abstract
Previous routeing algorithms for incomplete hypercubes deal only with single-path routeing and fail to take advantage of the flexibility provided by incomplete hypercubes. The authors present a simple effective routeing algorithm that forwards messages through two parallel paths between a pair of nodes in any incomplete hypercube with an even number of nodes. This algorithm proves to be deadlock-free under both store-and-forward and wormhole routeing modes. The mean latency for sending large size messages is apparently reduced by forwarding them to their destinations through two parallel paths. This reduction in latency would result in a significant performance improvement. This algorithm can also tolerate one fault in the system by sending duplicate copies of messages through two parallel paths.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
