Topological comparison of perfect shuffle and hypercube

Ran Ginosar, David Egozi
1989 International journal of parallel programming  
of Perfect Novel topological measures for static multiprocessor interconnection networks, disconnectivity, looseness', and cost-effectiveness, are developed. These and other measures are employed for a comparative analysis of such networks. The goal of this analysis is to predict network effectiveness, without resorting to execution benchmark techniques. In particular, we compare the hypereube and perfectshuffle-nearest-neighbor networks, and show that they are the best candidates for
more » ... ssor interconnections. We specifically find that the hypercube is capable of somewhat better performance than perfect-shuffle-nearest-neighbor, but the latter is significantly more cost-effective.
doi:10.1007/bf01409745 fatcat:7u2aiknaprhwrcyx3quajlvqti