Hyper-Star Graph : A New Interconnection Network Improving the Network Cost of the Hypercube

摘要

An interconnection network can be represented as an undirected graph where a processor is represented as a nod e, and a communication channel between processors as an edge between corresponding nodes. Tree, mesh, hypercu be, and star graph are popular interconnection networks. Measures of the desirable properties for interconnection net works include degree, connectivity, scalability, diameter, fault tolerance, and symmetry. There is a trade-off betwe en degree, related to hardware cost, and diameter, related to transmission time of messages. Thus, the network cost, defined by degree x diameter, is introduced as a measure for interconnection networks.