Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization in Communication Networks pp 427–465Cite as

Topological Properties of Interconnection Networks

  • Chapter

Part of the book series: Combinatorial Optimization ((COOP,volume 18))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akers S.B., Harel D., and Krishnamurthy B., The star graph: An attractive alternative to the n-cube, Proc. Int. Conf. Parallel Processing, 1987, 393–400.

    Google Scholar 

  2. Akl S.G., Qiu K., and Stojmenovic I., Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry, Networks, Vol. 23, 1993, 215–225.

    MATH  MathSciNet  Google Scholar 

  3. Arno S. and Wheeler F.S., Signed digit representations of minimal Hamming weight, IEEE Trans. on Computers, 42,8, 1993, 1007–1010.

    Article  Google Scholar 

  4. Bar-Noy A., and Peleg D., Square meshes are not always optimal, IEEE Trans. on Computers, 40,2, 1991, 196–204.

    Article  MathSciNet  Google Scholar 

  5. Bhatt S.N. and Ipsen C.F., How to embed trees into hypercubes. YALEU/DCS/RR-443, 1985.

    Google Scholar 

  6. Bruck J., Cypher R., and Ho C.-T., Fault-tolerant meshes and hypercubes with minimal numbers of spares, IEEE Trans. Computers, 42,9, 1993, 1089–1104.

    Article  Google Scholar 

  7. Becker B. and Simon H.U., How robust is the n-cube?, Proc. Symp. Foundation of Comp. Sci., 1986, 283–291.

    Google Scholar 

  8. Brent R.P., and Kung H.T., On the area of binary tree layouts, Information Processing Letters 11,1, 1980, 44046.

    Article  Google Scholar 

  9. Carle J., Myoupo J.F. and Stojmenovic I., Higher dimensional honeycomb networks, Journal of Interconnection Networks, 2,4, December 2001, 391–420.

    Article  Google Scholar 

  10. Chung F.R.K., Leighton F.T., and Rosenberg A.L., Embedding graphs in books, a layout problem with applications to VLSI design, SIAM J. Algebr. Discr. Meth., 8, 1987, 33–58.

    MATH  MathSciNet  Google Scholar 

  11. Chen M.S., Shin K.G., and Kandlur D.D., Addressing, routing, and broadcasting in hexagonal mesh multiprocessors, IEEE Trans. Computers, 39,1, 1990, 10–18.

    Article  MATH  Google Scholar 

  12. Corbett P.F., Rotator graphs: An efficient topology for point-to-point multiprocessor networks, IEEE Trans. Parallel and Distributed Systems, 3,5, 1992, 622–626.

    Article  Google Scholar 

  13. de Bruijn N.G., A combinatorial problem, Koninklijke Netherlands: Academie Van Wetenschappen, Proc. 49, part 20, 1946, 758–764.

    Google Scholar 

  14. Day K. and Tripathi A., Arrangement graphs: A class of generalized star graphs, Information Processing Letters 42, 1992, 235–241.

    Article  MATH  MathSciNet  Google Scholar 

  15. Graham N., Harary F., and Livingston M., Subcube fault tolerance in hypercubes, Information and Computation 102, 1993, 280–314.

    Article  MATH  MathSciNet  Google Scholar 

  16. Garcia Nocetti F., Stojmenovic I. and Zhang J., Addressing and routing in hexagonal networks with applications for location update and connection rerouting in cellular networks, IEEE Trans. Parallel and Distributed Systems, Vol. 13, No. 9, Sept. 2002, 963–971.

    Article  Google Scholar 

  17. Garcia F., Solano J., Stojmenovic I. and Stojmenovic M., Higher-dimensional hexagonal networks, Journal of Parallel and Distributed Computing, Vol. 63, Issue 11, November 2003, 1164–1172.

    Article  MATH  Google Scholar 

  18. Hsu W.J., Fibonacci cubes-a new interconnection topology, IEEE Trans. on Parallel and Distributed Systems, 4,1, 1993, 3–12.

    Article  Google Scholar 

  19. Johnsson S.L., Communication in network architectures, in: VLSI and Parallel Computation, Morgan-Kaufmann, 1990.

    Google Scholar 

  20. Kumar V.P. and Raghavendra C.S., Array processor with multiple broadcasting, J. Parallel and Distributed Computing, 2, 1987, 173–190.

    Article  MATH  Google Scholar 

  21. Martin A.J., The torus, an exercise in constructing a processing surface, Proc. 2nd Caltech Conf. VLSI, 1981, 527–537.

    Google Scholar 

  22. Mead C.A. and Conway L., Introduction to VLSI Systems, Addison-Wesley, 1980.

    Google Scholar 

  23. Menn A. and Somani A.K., An efficient sorting algorithm for the star graph interconnection network, Proc. Int. Conf. Parallel Processing, 1990, 1–8.

    Google Scholar 

  24. Saad Y. and Schultz M.H., Topological properties of hypercubes, IEEE Trans. Computers, 37,7, 1988, 867–872.

    Article  Google Scholar 

  25. Siegel H.J., Interconnection Networks for Large Scale Parallel Processing, Heath and Co., 1985.

    Google Scholar 

  26. Samatham M.R. and Pradhan D.K., The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI, IEEE Trans. on Computers 38,4, 1989, 567–581.

    Article  MATH  MathSciNet  Google Scholar 

  27. Stojmenovic I., Multiplicative circulant networks: Topological properties and communication algorithms, Discrete Applied Mathematics, 77, 1997, 281–305.

    Article  MATH  MathSciNet  Google Scholar 

  28. Stojmenovic I., Honeycomb networks: Topological properties and communication algorithms, IEEE Trans. Parallel and Distributed Systems, Vol. 8, No. 10, October 1997, 1036–1042.

    Article  Google Scholar 

  29. Stojmenovic I., Direct interconnection networks, in: Parallel and Distributed Computing Handbook (A.Y. Zomaya, ed.), McGraw-Hill, 1996, 537–567.

    Google Scholar 

  30. Stojmenovic I., Optimal deadlock-free routing and broadcasting on Fibonacci cube networks, Utilitas Mathematica, Vol. 53, May 1998, 159–166.

    MATH  MathSciNet  Google Scholar 

  31. Stojmenovic I., Routing and broadcasting on incomplete and Gray code incomplete hypercubes, Parallel Algorithms and Applications, Vol. 1, No. 3, 1993, 167–177.

    Google Scholar 

  32. Thompson C.D., Area-time complexity for VLSI, Proc. 11th ACM Symp. on Theory of Computing, 1979, 81–88.

    Google Scholar 

  33. Wong C.K. and Coppersmith D., A combinatorial problem related to multimodule memory organizations, J. ACM, 21,3, 1974, 392–402.

    Article  MATH  MathSciNet  Google Scholar 

  34. Zaks S., A new algorithm for generation of permutations, BIT, 24, 1984, 196–204.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SITE, University of Ottawa, Ottawa, Ont, K1N6N5, Canada

    Ivan Stojmenovic

Authors
  1. Ivan Stojmenovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Missouri, Rolla, Missouri

    Maggie Xiaoyan Cheng

  2. Georgia State University, Atlanta, Georgia

    Yingshu Li

  3. University of Texas at Dallas, Richardson, Texas

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Stojmenovic, I. (2006). Topological Properties of Interconnection Networks. In: Cheng, M.X., Li, Y., Du, DZ. (eds) Combinatorial Optimization in Communication Networks. Combinatorial Optimization, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-387-29026-5_16

Download citation

  • DOI: https://doi.org/10.1007/0-387-29026-5_16

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-29025-6

  • Online ISBN: 978-0-387-29026-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation