Skip to main content

Other Hypercubic Architectures

  • Chapter
Introduction to Parallel Processing

Part of the book series: Series in Computer Science ((SCS))

  • 493 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References and Suggested Reading

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Cull, P., and S. M. Larson, “The Möbius Cubes,” IEEE Trans. Computers, Vol. 44, No. 5, pp. 647–659, May 1995.

    Article  MathSciNet  Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Article  MathSciNet  Google Scholar 

  6. 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.

    MathSciNet  Google Scholar 

  7. 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.

    Google Scholar 

  8. Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.

    Google Scholar 

  9. 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.

    Google Scholar 

  10. 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.

    Google Scholar 

Download references

Rights and permissions

Reprints 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

Publish with us

Policies and ethics