Abstract
We consider the problem of embedding perfect shuffle and shuffle exchange networks in hypercubes. We prove that perfect embedding is possible for perfect shuffle with 2 k nodes only when k is a power of 2, and we give an efficient algorithm for embedding perfect shuffle networks with 2 k nodes when k is a power of 2. We also discuss a scheme for embedding shuffle exchange networks with 2 k nodes, k being a power of 2, and give its extensions to the general case.
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.
