Title :
Reconfigurable cube architecture for parallel computation
Author_Institution :
Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA
Abstract :
The construction of a dynamic cube network architecture that extends the capabilities of hypercube architectures with only a small increase in hardware complexity is described. The network is self-routing in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of the vertices. This, together with other improvements in embedding properties, makes the dynamic cube an attractive alternative to the ordinary hypercube for massively parallel architectures
Keywords :
computational complexity; fault tolerant computing; hypercube networks; parallel architectures; reconfigurable architectures; distributed routing algorithm; dynamic cube network architecture; hardware complexity; hypercube architectures; massively parallel architectures; optimal paths; parallel computation; reconfigurable cube architecture; self-routing; Broadcasting; Computer architecture; Computer networks; Concurrent computing; Hypercubes; Network topology; Partitioning algorithms; Performance analysis; Routing; Switches;
Conference_Titel :
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location :
Yokohama
Print_ISBN :
0-8186-2865-0
DOI :
10.1109/ICDCS.1992.235035
