A method of trading diameter for reduced degree to construct low cost interconnection networks
Proceedings of the 1999 ACM symposium on Applied computing
The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors
Proceedings of the 2005 ACM symposium on Applied computing
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks
IEEE Transactions on Parallel and Distributed Systems
Swapped interconnection networks: Topological, performance, and robustness attributes
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Multiswapped networks and their topological and algorithmic properties
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In this paper, we propose a new class of interconnection networks called hierarchical swapped networks (HSNs). We show that some subclasses of HSNs can efficiently emulate hypercubes, or generalized hypercubes, while having node degrees significantly smaller than the emulated ones. In particular, a suitably constructed HSN can emulate a hypercube or generalized hypercube with constant slowdown under the single-dimension communication model and asymptotically optimal slowdown with respect to its node degree under the all-port communication model. As a consequence, we obtain a variety of efficient algorithms on HSNs through emulation, thus proving the versatility of HSNs. Some subclasses of HSNs are also shown to have asymptotically optimal diameters with respect to their node degrees. HSNs appear to be attractive low-degree alternatives to hypercubes and generalized hypercubes as general-purpose parallel computers.