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.
Preview
Unable to display preview. Download preview PDF.
References
R. Aleliunas, A. L. Rosenberg, "On Embedding Rectangular Grids in Square Grids", IEEE Trans. on Computers, C-31,9 (1982), pp. 907–913.
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.
B. Becker, H. U. Simon, "How Robust is the n-Cube?" Proc. 27th IEEE Symp. Foundations of Computer Sci., Oct. 1986, pp 283–291.
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.
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.
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.
S. Bhatt, S. S. Cosmadakis, "The Complexity of Minimizing Wire Lengths for VLSI Layouts", Info. Processing Letters 25 (1987).
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.
D. Bienstock, "On Embedding Graphs in Trees", manuscript, Bell Communications Research, Morristown, New Jersey 07060, U.S.A., 1988.
J. E. Brandenburg, D. S. Scott, "Embeddings of Communication Trees and Grids into Hypercubes", Intel Scientific Computers Report, #280182-001, 1985.
M. Y. Chan, "Dilation 2 Embedding of Grids into Hypercubes", Tech. Report, Computer Science Program, Univ. Texas at Dallas, 1988.
M. Y. Chan, F. Y. L. Chin, "On Embedding Rectangular Grids in Hypercubes", to appear in IEEE Trans. on Computers
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.
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.
F.R.K. Chung, "Labelings of Graphs", A chapter in Selected Topics in Graph Theory, III, (eds. L. Beinike and R. Wilson).
F.R.K. Chung, F. T. Leighton, A.L. Rosenberg, "A Graph Layout Problem with Applications to VLSI Design", manuscript, 1985.
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.
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.
J. A. Ellis, "Embedding Graphs in Lines, Trees, and Grids", Ph.D. Thesis, Northwestern Univ., Evanston, Illinois, U.S.A. (1984).
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.
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).
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.
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.
D. S. Greenberg, "Optimum Expansion Embeddings of Meshes in Hypercube", Technical Report YALEU/CSD/RR-535, Yale University, Dept. of Computer Science.
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.
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.
I. Havel, "On Hamiltonian Circuits and Spanning Trees of Hypercubes", Cas. Pest. Mat. (in Czech.), 109 (1984), pp. 135–152.
I. Havel, P. Liebl, "One Legged Caterpillars Span Hypercubes", J. Graph Theory, 10 (1986), pp. 69–76.
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.
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.
J. W. Hong, A. L. Rosenberg, "Graphs that are Almost Binary Trees", SIAM J. Computing 11,2 (1982), pp. 227–242.
J. W. Hong, K. Mehlhorn, A. Rosenberg, "Cost Trade-offs in Graph Embeddings with Applications", J. ACM, 30,4 (1983), pp. 709–728.
S. R. Kosaraju, M. J. Atallah, "Optimal Simulations Between Mesh-Connected Arrays of Processors", Proc. 1986 ACM Theory of Computing Symp., pp. 264–272.
D. W. Krumme, K.N. Venkataraman, G. Cybenko, "Hypercube Embedding is NP-complete", Proc. of Hypercube Conf., SIAM, Knoxville, Tennessee, Sept., 1985.
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.
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.
Y. E. Ma, L. Tao, "Embeddings among Toruses and Meshes", Proc. of the 1987 Int. Conf. on Parallel Processing, August, 1987, pp. 178–187.
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.
F. Makedon, C. H. Papadimitriou, I.H. Sudborough, "Topological Bandwidth", SIAM J. Alg. and Discrete Meth. 6 (1985), pp. 418–444.
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.
F. Makedon, I. H. Sudborough, "Graph Layout Problems", Surveys in Computer Science (ed. H. Maurer), Bibliographisches Institut, Zurich, 1984, pp. 145–192
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.
Z. Miller, "A Linear Algorithm for Topological Bandwidth in Degree 3 Trees", to appear in SIAM J. Computing.
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.
B. Monien, "The Problem of Embedding Trees into Binary Trees is NP-Complete", manuscript (1984).
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.
B. Monien, I. H. Sudborough, "Min Cut is NP-complete for Edge Weighted Trees", to appear in Theoretical Computer Science.
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.
B. Monien, I. H. Sudborough, "Bandwidth constrained NP complete problems", Theoretical Computer Science 41 (1985), pp. 141–167.
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.
L. Nebesky, "On Cubes and Dichotomic Trees", Cas. Pest. Mat. (in Czech.), 99 (1974), pp. 164–167.
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.
Y. Saad and M. H. Schultz, "Data Communication in Hypercubes", Yale University Research Reprot RR-428, October 1985.
M. Sekanina, "On an Ordering of the Set of Vertices of a Connected Graph", Publications Faculty Science, Univ. Brno 412 (1960), pp. 137–142.
C. G. Simonson, "A Variation on the Min Cut Linear Arrangement Problem", to appear in Math. Systems Theory.
I. H. Sudborough, "Bandwidth constraints on problems complete for polynomial time", Theoretical Computer Science, 26 (1983), pp. 25–52.
J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, 11 Taft Court, Rockville, Maryland 20850, U.S.A., 1984.
A. Y. Wu, "Embedding of Tree Networks into Hypercubes", J. of Parallel and Distributed Computing, 2,3 (1985), pp. 238–249.
M. Yannakakis, "A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees", J. ACM, 32,4 (1985), pp. 950–959.
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.
Author information
Authors and Affiliations
Editor information
Rights 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