Regular articleOn the problem of expanding hypercube-based systems☆
References (24)
- et al.
Mapping pyramid algorithms into hypercubes
J. Parallel Distrib. Comput.
(1990) Embedding of tree networks into hypercubes
J. Parallel Distrib. Comput.
(Aug. 1985)- et al.
An analysis of the twisted cube topology
- et al.
Properties and performance of folded hypercubes
IEEE Trans. Parallel Distrib. Systems
(Jan. 1991) The cubical ring connected cycles: A fault-tolerant parallel computation network
IEEE Trans. Comput.
(May 1988)- et al.
Multigrid algorithms on the hypercube multiprocessor
IEEE Trans. Comput.
(Aug. 1988) - et al.
Enhanced incomplete hypercubes
- et al.
The generalized folding-cube
- et al.
Scalability of a binary tree on a hypercube
The twisted Ncube with application to multiprocessing
IEEE Trans. Comput.
(Jan. 1991)
The HCN: A versatile interconnection network based on cubes
Cited by (0)
- ☆
This material is based upon work supported in part by the National Science Foundation under Grant CCR-9109084.
Copyright © 1992 Published by Elsevier Inc.