Abstract
O(k log n) algorithms are obtained to permute and sort n data items on cube and perfect shuffle computers with n/sup 1+1/k/ processing elements, 1>k>log n. These algorithms lead directly to a generalized-connection-network construction having o(k log n) delay and o(kn/sup 1+1/k/log n) contact pairs. This network has the advantage that the switches can be set in o(k log n) time by either a cube or perfect shuffle computer with n/sup 1+1/k/ processing elements. 23 references.
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.
