Abstract
The cube-connected cycles (CCC) was proposed by Preparata and Vuillemin as an efficient general-purpose parallel system for its fixed-degree, and compact and regular layout. In this paper, a few of the basic algorithms on CCC ( n , 2 n ) interconnection networks are addressed and then applied to concentration, superconcentration, partial permutation routing, and load-balancing problems. The results show that both concentration and superconcentration problems can be solved in O ( n ) time and the on-line partial permutation routing problem in O ( n 2 ) time with O ( 1 ) buffers for each node, where n is the dimension of CCC ( n , 2 n ) interconnection networks. The load-balancing problem based on superconcentration can be solved in O ( Mn ) time, where M is the maximum number of tasks in each node.
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.
