Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References and Suggested Reading
Bhuyan, L., and D. P. Agrawal, “Generalized Hypercube and Hyperbus Structures for a Computer Network,” IEEE Trans. Computers, Vol. 33, No. 4, pp. 323–333, April 1984.
Bornstein, C. et al., “On the Bisection Width and Expansion of Butterfly Networks,” Proc. Joint Int. Conf. Parallel Processing & Symp. Parallel Distributed Systems, 1998, pp. 144–150.
Cull, P., and S. M. Larson, “The Möbius Cubes,” IEEE Trans. Computers, Vol. 44, No. 5, pp. 647–659, May 1995.
El-Amawy, A., and S. Latifi, “Properties and Performance of Folded Hypercubes,” IEEE Trans. Parallel Distributed Systems, Vol. 2, No. 1, pp. 31–42, January 1991.
Esfahanian, A.-H., L. M. Ni, and B. E. Sagan, “The Twisted N-Cube with Application to Multiprocessing,” IEEE Trans. Computers, Vol. 40, No. 1, pp. 88–93, January 1991.
Kwai, D.-M., and B. Parhami, “A Generalization of Hypercubic Networks Based on Their Chordal Ring Structures,” Information Processing Letters, Vol. 6, No. 4, pp. 469–477, 1996.
Kwai, D.-M., and B. Parhami, “A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes,” Proc. Int. Conf. Parallel Processing, 1997, pp. 92–95.
Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.
Meliksetian, D. S., and C. Y. R. Chen, “Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles,” IEEE Trans. Parallel Distributed Systems, Vol. 4, No. 10, pp. 1172–1178, October 1993.
Ohring, S. R., M. Ibel, S. K. Das, and M. J. Kumar, “On Generalized Fat Trees,” Proc. 9th Int. Parallel Processing Symp., 1995, pp. 37–44.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). Other Hypercubic Architectures. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_15
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive