Abstract
Cyclic shifts are intrinsic operations in many parallel algorithms. Therefore, it is important to execute them efficiently. In this note, we present and analyze an algorithm for the cyclic shift operation onn-dimensional (distributed memory) hypercubes. On asynchronous hypercubes, we have shown that all previously known algorithms for cyclic shifts need local message buffers. In order to overcome this, we present an algorithm that always uses link-disjoint paths for routing. We prove that by using this algorithm, any cyclic shift can be realized by using at most 4/3nsteps, without using any local message buffers.
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.
