Issue No. 05 - September (1992 vol. 3)

ISSN: 1045-9219

pp: 513-524

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.159036

ABSTRACT

The construction of a crossed cube which has many of the properties of the hypercube, but has diameter only about half as large, is discussed. This network is self-routing, in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of vertices. This fact, together with other properties such as regularity, symmetry, high connectivity, and a simple recursive structure, suggests that the crossed cube may be an attractive alternative to the ordinary hypercube for massively parallel architectures, SIMD algorithms, which utilize the architecture are developed, and it is shown that the CQ/sub n/ architecture can profitably emulate the ordinary hypercube. It is also shown that addition of simple switches can improve the capabilities of the system significantly. For instance, the dynamic reconfiguration capability allows hypercube algorithms to be executed on the proposed architecture. The use of these switches also improves the embedding properties of the system.

INDEX TERMS

Index Termsself routing network; crossed cube architecture; parallel computation; distributed routingalgorithm; regularity; symmetry; high connectivity; recursive structure; massively parallel architectures; SIMD algorithms; CQ/sub n/ architecture; switches; dynamicreconfiguration; hypercube algorithms; embedding properties; multiprocessorinterconnection networks; parallel algorithms; parallel architectures

CITATION

K. Efe, "The Crossed Cube Architecture for Parallel Computation",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 3, no. , pp. 513-524, September 1992, doi:10.1109/71.159036