F Harary, JP Hayes, HJ Wu - Computers & Mathematics with Applications, 1988 - Elsevier
We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to distance, coloring, domination and genus are reviewed. The properties of the n …
SL Johnsson, CT Ho - IEEE Transactions on computers, 1989 - ieeexplore.ieee.org
Four different communication problems are addressed in Boolean n-cube configured multiprocessors:(1) one-to-all broadcasting: distribution of common data from a single …
ES Kuh, T Ohtsuki - Proceedings of the IEEE, 1990 - ieeexplore.ieee.org
The current status of VLSI layout and directions for future research are addressed, with emphasis on the authors' own work. Necessary terminology and definitions and, whenever …
K Day, A Tripathi - IEEE Transactions on Parallel and …, 1994 - ieeexplore.ieee.org
Undertakes a comparative study of two important interconnection network topologies: the star graph and the hypercube, from the graph theory point of view. Topological properties …
NF Tzeng, S Wei - IEEE Transactions on Computers, 1991 - computer.org
A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the …
The twisted N-cube with application to multiprocessing - Computers, IEEE Transactions on Page 1 IEEE TRANSACTIONS ON COMPUTERS, VOL. 40, NO. 1, JANUARY 1991 88 …
D Wang - IEEE Transactions on Computers, 1999 - ieeexplore.ieee.org
A. Sengupta and A. Dahbura (1992) discussed how to characterize a diagnosable system under the comparison diagnosis model proposed by J. Maeng and M. Malek (1981) and a …
A performance analysis of a class of hierarchical interconnection networks is presented. The analysis includes both static analysis (ie queueing delays are neglected) and queueing …
The fat-tree topology is one of the most commonly used network topologies in HPC systems. Vendors support several options that can be configured when deploying fat-tree networks on …