Skip to main content
SpringerLink
Log in

Comparing interconnection networks

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

Abstract

We review results on embedding network and program structures into popular parallel computer structures. Such embeddings can be viewed as high level descriptions of efficient methods to simulate an algorithm designed for one type of architecture on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Aleliunas, A. L. Rosenberg, "On Embedding Rectangular Grids in Square Grids", IEEE Trans. on Computers, C-31,9 (1982), pp. 907–913.

    Google Scholar 

  2. F.N. Annexstein, M. Baumslag, A. L. Rosenberg, "Group Action Graphs and Parallel Architectures", manuscript, Computer and Info. Sci., University of Massachusetts, Amherst, Massachusetts 01003, U.S.A., 1987.

    Google Scholar 

  3. B. Becker, H. U. Simon, "How Robust is the n-Cube?" Proc. 27th IEEE Symp. Foundations of Computer Sci., Oct. 1986, pp 283–291.

    Google Scholar 

  4. S. Bettayeb, Z. Miller, I. H. Sudborough, "Embedding Grids into Hypercubes", Proc. of Aegean Workshop On Computing, Springer Verlag's Lecture Notes in Computer Science, to appear, 1988.

    Google Scholar 

  5. S. Bhatt, F. Chung, T. Leighton, A. Rosenberg, "Optimal Simulation of Tree Machines", Proc. 27th Annual IEEE Symp. Foundations of Computer Sci., Oct. 1986, pp. 274–282.

    Google Scholar 

  6. S. Bhatt, F. Chung, J.-W. Hong, T. Leighton, A. Rosenberg, "Optimal Simulations by Butterfly Networks", Proc. 20th Annual ACM Theory of Computing Symp., 1988, pp. 192–204.

    Google Scholar 

  7. S. Bhatt, S. S. Cosmadakis, "The Complexity of Minimizing Wire Lengths for VLSI Layouts", Info. Processing Letters 25 (1987).

    Google Scholar 

  8. S. N. Bhatt, I. C. F. Ipsen, "How to Embed Trees in Hypercubes", Research Report YALEU/DCS/RR-443, Yale University, Dept. of Computer Science, 1985.

    Google Scholar 

  9. D. Bienstock, "On Embedding Graphs in Trees", manuscript, Bell Communications Research, Morristown, New Jersey 07060, U.S.A., 1988.

    Google Scholar 

  10. J. E. Brandenburg, D. S. Scott, "Embeddings of Communication Trees and Grids into Hypercubes", Intel Scientific Computers Report, #280182-001, 1985.

    Google Scholar 

  11. M. Y. Chan, "Dilation 2 Embedding of Grids into Hypercubes", Tech. Report, Computer Science Program, Univ. Texas at Dallas, 1988.

    Google Scholar 

  12. M. Y. Chan, F. Y. L. Chin, "On Embedding Rectangular Grids in Hypercubes", to appear in IEEE Trans. on Computers

    Google Scholar 

  13. T. F. Chan, Y. Saad, "Multigrid Algorithms on the Hypercube Multiprocessor", IEEE Trans. on Comp., Vol c-35, No. 11, Nov. 1986, pp. 969–977.

    Google Scholar 

  14. P.Z. Chinn, J. Chvatalova, A.K. Dewdney, N.E. Gibbs, "The Bandwidth Problem for Graphs and Matrices — A Survey", J. Graph Theory, 6 (1982), pp. 223–254.

    Google Scholar 

  15. F.R.K. Chung, "Labelings of Graphs", A chapter in Selected Topics in Graph Theory, III, (eds. L. Beinike and R. Wilson).

    Google Scholar 

  16. F.R.K. Chung, F. T. Leighton, A.L. Rosenberg, "A Graph Layout Problem with Applications to VLSI Design", manuscript, 1985.

    Google Scholar 

  17. M.-J. Chung, F. Makedon, I. H. Sudborough, J. Turner, "Polynomial Algorithms for the Min-Cut Linear Arrangement Problem on Degree Restricted Trees", SIAM J. Computing 14,1 (1985), pp. 158–177.

    Google Scholar 

  18. G. Cybenko, D. W. Krumme, K.N. Venkataraman, A. Couch, "Heterogeneous Processes on Homogeneous Processors", manuscript, Dept. of Computer Sci., Tufts University, Medford, Massachusetts 02155 U.S.A., 1986.

    Google Scholar 

  19. J. A. Ellis, "Embedding Graphs in Lines, Trees, and Grids", Ph.D. Thesis, Northwestern Univ., Evanston, Illinois, U.S.A. (1984).

    Google Scholar 

  20. J. A. Ellis, "Embedding Rectangular grids into Square Grids", Proc. of Aegean Workshop On Computing, Springer Verlag's Lecture Notes in Computer Science, to appear, 1988.

    Google Scholar 

  21. J. A. Ellis, I. H. Sudborough, J. Turner, "Graph Separation and Searching", manuscript, Computer Science Program, University of Victoria, P. O. Box 1700, Victoria, B.C. V8W 2Y2, Canada (1987).

    Google Scholar 

  22. M. R. Fellows, M.A. Langston, "Layout Permutation Problems and Well-Partially-Ordered Sets", manuscript, Department of Computer Science, Washington State University, Pullman, Washington, 99164-1210 U.S.A., 1988.

    Google Scholar 

  23. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, 1979.

    Google Scholar 

  24. D. S. Greenberg, "Optimum Expansion Embeddings of Meshes in Hypercube", Technical Report YALEU/CSD/RR-535, Yale University, Dept. of Computer Science.

    Google Scholar 

  25. E. Gurari, I. H. Sudborough, "Improved dynamic programming algorithms for bandwidth minimization and the min cut linear arrangement problem" J. Algorithms, 5 (1984), pp. 531–546.

    Google Scholar 

  26. J. Hastad, T. Leighton, M. Newman, "Reconfiguring a Hypercube in the Presence of Faults", Proc. 19th Annual ACM Symp. Theory of Computing, May 25–27, 1987.

    Google Scholar 

  27. I. Havel, "On Hamiltonian Circuits and Spanning Trees of Hypercubes", Cas. Pest. Mat. (in Czech.), 109 (1984), pp. 135–152.

    Google Scholar 

  28. I. Havel, P. Liebl, "One Legged Caterpillars Span Hypercubes", J. Graph Theory, 10 (1986), pp. 69–76.

    Google Scholar 

  29. L.S. Heath, A. L. Rosenberg, "An Optimal Mapping of the FFT Algorithm onto the Hypercube Architecture", COINS Tech. Report 87-19, Computer and Info. Sci., University of Massachusetts, Amherst, Massachussets 01003, U.S.A., 1987.

    Google Scholar 

  30. C.-T. Ho, S. L. Johnson, "On the Embedding of Arbitrary Meshes in Boolean Cubes with Expansion Two Dilation Two", Proc. 1987 International Conference on Parallel Processing, pp. 188–191.

    Google Scholar 

  31. J. W. Hong, A. L. Rosenberg, "Graphs that are Almost Binary Trees", SIAM J. Computing 11,2 (1982), pp. 227–242.

    Google Scholar 

  32. J. W. Hong, K. Mehlhorn, A. Rosenberg, "Cost Trade-offs in Graph Embeddings with Applications", J. ACM, 30,4 (1983), pp. 709–728.

    Google Scholar 

  33. S. R. Kosaraju, M. J. Atallah, "Optimal Simulations Between Mesh-Connected Arrays of Processors", Proc. 1986 ACM Theory of Computing Symp., pp. 264–272.

    Google Scholar 

  34. D. W. Krumme, K.N. Venkataraman, G. Cybenko, "Hypercube Embedding is NP-complete", Proc. of Hypercube Conf., SIAM, Knoxville, Tennessee, Sept., 1985.

    Google Scholar 

  35. T.-H. Lai, W. White, "Embedding Pyramids into Hypercubes", OSU-CISRC-11/87-TR41, Dept. of Computer and Info. Sci., The Ohio State Univ., Columbus, Ohio, 43210, U.S.A., 1988.

    Google Scholar 

  36. T.-H. Lai, W. White, "Mapping Multiple Pyramids into Hypercubes Using Unit Expansion", manuscript, Dept. of Computer and Info. Sci., The Ohio State Univ., Columbus, Ohio, 43210, U.S.A., 1988.

    Google Scholar 

  37. Y. E. Ma, L. Tao, "Embeddings among Toruses and Meshes", Proc. of the 1987 Int. Conf. on Parallel Processing, August, 1987, pp. 178–187.

    Google Scholar 

  38. F. Makedon, T. Leighton, I. H. Sudborough, "Simulating Pyramid Machines with a Hypercube", manuscript, Computer Science Program, University of Texas at Dallas, Richardson, Texas 75083-0688, U.S.A., 1988.

    Google Scholar 

  39. F. Makedon, C. H. Papadimitriou, I.H. Sudborough, "Topological Bandwidth", SIAM J. Alg. and Discrete Meth. 6 (1985), pp. 418–444.

    Google Scholar 

  40. F. Makedon, I.H. Sudborough, "Minimizing Width in Linear Layouts", Springer Verlag's Lecture Notes in Computer Science, Vol. 154 (1985), pp. 478–490; to appear in Discrete Applied Math.

    Google Scholar 

  41. F. Makedon, I. H. Sudborough, "Graph Layout Problems", Surveys in Computer Science (ed. H. Maurer), Bibliographisches Institut, Zurich, 1984, pp. 145–192

    Google Scholar 

  42. F. Makedon, C. G. Simonson, I. H. Sudborough, "On the complexity of tree embedding problems", manuscript, Computer Science Program, University of Texas at Dallas, Richardson, Texas, 75083-0688, U.S.A., 1988.

    Google Scholar 

  43. Z. Miller, "A Linear Algorithm for Topological Bandwidth in Degree 3 Trees", to appear in SIAM J. Computing.

    Google Scholar 

  44. Z. Miller, I. H. Sudborough, "A Polynomial Algorithm for Recognizing Small Cutwidth in Hypergraphs", Proc. of Aegean Workshop On Computing, Springer Verlag's Lecture Notes in Computer Science, vol. 227 (1986), pp. 252–260.

    Google Scholar 

  45. B. Monien, "The Problem of Embedding Trees into Binary Trees is NP-Complete", manuscript (1984).

    Google Scholar 

  46. B. Monien, G. Spenner, W. Unger, and G. Wechsung, "On the Edge Length of Embedding Caterpillars into Various Networks", manuscript, Dept. of Math. and Computer Science, Univ. Paderborn, Paderborn, W. Germany, 1988.

    Google Scholar 

  47. B. Monien, I. H. Sudborough, "Min Cut is NP-complete for Edge Weighted Trees", to appear in Theoretical Computer Science.

    Google Scholar 

  48. B. Monien, I. H. Sudborough, "Simulating Binary Trees on Hypercubes", Proc. of Aegean Workshop On Computing, Springer Verlag's Lecture Notes in Computer Science, to appear, 1988.

    Google Scholar 

  49. B. Monien, I. H. Sudborough, "Bandwidth constrained NP complete problems", Theoretical Computer Science 41 (1985), pp. 141–167.

    Google Scholar 

  50. B. Monien, I. H. Sudborough, "On eliminating nondeterminism from Turing machines that use less than logarithm worktape space", Theoretical Computer Science 21 (1982), pp. 237–253.

    Google Scholar 

  51. L. Nebesky, "On Cubes and Dichotomic Trees", Cas. Pest. Mat. (in Czech.), 99 (1974), pp. 164–167.

    Google Scholar 

  52. S. Rajasekaran, T. Tsantilas, D. Krisanc, "Optimal Routing Algorithms for Mesh-Connected Processor Arrays", Proc. of Aegean Workshop On Computing Springer Verlag's Lecture Notes in Computer Science, to appear, 1988.

    Google Scholar 

  53. Y. Saad and M. H. Schultz, "Data Communication in Hypercubes", Yale University Research Reprot RR-428, October 1985.

    Google Scholar 

  54. M. Sekanina, "On an Ordering of the Set of Vertices of a Connected Graph", Publications Faculty Science, Univ. Brno 412 (1960), pp. 137–142.

    Google Scholar 

  55. C. G. Simonson, "A Variation on the Min Cut Linear Arrangement Problem", to appear in Math. Systems Theory.

    Google Scholar 

  56. I. H. Sudborough, "Bandwidth constraints on problems complete for polynomial time", Theoretical Computer Science, 26 (1983), pp. 25–52.

    Google Scholar 

  57. J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, 11 Taft Court, Rockville, Maryland 20850, U.S.A., 1984.

    Google Scholar 

  58. A. Y. Wu, "Embedding of Tree Networks into Hypercubes", J. of Parallel and Distributed Computing, 2,3 (1985), pp. 238–249.

    Google Scholar 

  59. M. Yannakakis, "A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees", J. ACM, 32,4 (1985), pp. 950–959.

    Google Scholar 

  60. M. A. Yannakakis, "Linear and Book Embeddings of Graphs", Proc. of Aegean Workshop On Computing, Springer Verlag's Lecture Notes in Computer Science, vol. 227 (1986), pp. 226–235.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universitat Paderborn, 4790, Paderborn, Federal Republic of Germany

    Burkhard Monien

  2. Computer Science Program, MP 31, University of Texas at Dallas, 75083-0688, Richardson, Texas, USA

    Hal Sudborough

Authors
  1. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hal Sudborough
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Sudborough, H. (1988). Comparing interconnection networks. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017137

Download citation

  • DOI: https://doi.org/10.1007/BFb0017137

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation