Communications of the ACM - Special section on computer architecture
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Embedding mesh of trees in the hypercube
Journal of Parallel and Distributed Computing
The SGI Origin: a ccNUMA highly scalable server
Proceedings of the 24th annual international symposium on Computer architecture
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Computer Algorithms: C++
The Alpha 21364 Network Architecture
IEEE Micro
A Cube-Connected Cycles Architecture with High Reliability and Improved Performance
IEEE Transactions on Computers
Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles
IEEE Transactions on Parallel and Distributed Systems
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
| Hi-index | 0.00 |
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.