Title :
A variation on the hypercube with lower diameter
Author_Institution :
Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA
fDate :
11/1/1991 12:00:00 AM
Abstract :
A new interconnection structure is proposed as a basis for distributed-memory parallel computer architectures. The network is a variation of the hypercube and preserves many of its desirable properties, including regularity and large vertex connectivity. It has the same node and link complexity, but has a diameter only about half of the hypercube´s. Some of the basic properties of this topology are discussed. Efficient routing and broadcasting algorithms are presented
Keywords :
hypercube networks; parallel architectures; broadcasting algorithms; distributed-memory parallel computer architectures; hypercube; interconnection structure; large vertex connectivity; link complexity; regularity; routing; Broadcasting; Computer architecture; Computer networks; Concurrent computing; Hypercubes; Multiprocessor interconnection networks; Parallel architectures; Partitioning algorithms; Routing; Topology;
Journal_Title :
Computers, IEEE Transactions on
