Abstract
In this paper, a new interconnection network called the incomplete crossed hypercube is proposed for connecting processors of parallel computing systems. The incomplete crossed hypercube architecture denoted by CI n?m n is made by combining two complete crossed hypercubes CQ n and CQ n?m for 1?m?n. Several topological properties of CI n?m n are analyzed. In particular, accurate mean internode distance formulas of both CQ n and CI n?m n are given. Compared with the incomplete enhanced hypercube EI n?m n , CI n?m n has shorter mean internode distance for large n. An optimal routing algorithm for CI n?m n is also described which guarantees the generation of a shortest path from a node to another in CI n?m n .
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 callDisclaimer: 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.
