The cubical ring connected cycles: A fault-tolerant parallel computation network
For a wide class of problems such as the discrete Fourier transform, sorting, integer multiplication, etc., there are algorithms whose data exchange patterns correspond to the links of the multidimensional cube. Since the cube is not directly usable in VLSI design, other networks such as the shuffle-exchange and the cube-connected cycles networks have been proposed to substitute for the cube connection. The cube-connected cycles network is suitable for realization in VLSI since it satisfies the properties of degree boundedness of the nodes (=3), and regularity of layout. In this correspondence, the authors propose another network the cubical ring connected cycles (CRCC), which has all the desirable features of the CCC and is single-cycle fault tolerant as well. The degree of each processor is less than or equal to four, the number of processors.
- Research Organization:
- Dept. of Electrical and Computer Engineering and the Coordinated Science Lab., Univ. of Illinois, Urbana, IL (US)
- OSTI ID:
- 6637272
- Journal Information:
- IEEE Trans. Comput.; (United States), Vol. 37:5
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient VLSI networks for parallel processing based on orthogonal trees
Efficient parallel algorithms on the network model. Doctoral thesis