Comparing Interconnection Networks

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.

[1]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[2]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[3]  Ivan Havel,et al.  One-legged caterpillars span hypercubes , 1986, J. Graph Theory.

[4]  Yousef Saad,et al.  Multigrid Algorithms on the Hypercube Multiprocessor , 1986, IEEE Transactions on Computers.

[5]  Bernd Becker,et al.  How Robust Is the n-Cube? (Extended Abstract) , 1986, FOCS.

[6]  Arnold L. Rosenberg,et al.  Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[7]  Ilse C. F. Ipsen,et al.  How to Embed Trees in Hypercubes. , 1985 .

[8]  Fillia Makedon,et al.  Minimizing Width in Linear Layouts , 1983, ICALP.

[9]  Lixin Tao,et al.  Embeddings Among Toruses and Meshes , 1987, ICPP.

[10]  Mihalis Yannakakis,et al.  A polynomial algorithm for the MIN CUT linear arrangement of trees , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Angela Y. Wu,et al.  Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..

[12]  Ivan Hal Sudborough,et al.  Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[13]  Arnold L. Rosenberg,et al.  Optimal simulations by Butterfly Networks , 1988, STOC '88.

[14]  Mikhail J. Atallah,et al.  Optimal simulations between mesh-connected arrays of processors , 1986, STOC '86.

[15]  Arnold L. Rosenberg,et al.  On Embedding Rectangular Grids in Square Grids , 1982, IEEE Transactions on Computers.

[16]  Ivan Hal Sudborough,et al.  Simulating Binary Trees on Hypercubes , 1988, AWOC.

[17]  Arnold L. Rosenberg,et al.  Cost Trade-offs in Graph Embeddings, with Applications , 1983, JACM.

[18]  Fillia Makedon,et al.  Polynomial time algorithms for the MIN CUT problem on degree restricted trees , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[19]  L. Nebeský.  On cubes and dichotomic trees , 1974 .

[20]  Eitan M. Gurari,et al.  Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem , 1984, J. Algorithms.

[21]  Jia-Wei Hong,et al.  Graphs that are Almost Binary Trees , 1982, SIAM J. Comput..

[22]  Ivan Hal Sudborough,et al.  On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space , 1982, Theor. Comput. Sci..

[23]  Michael R. Fellows,et al.  Layout permutation problems and well-partially-ordered sets , 1988 .

[24]  Ivan Hal Sudborough,et al.  Bandwidth Constrained NP-Complete Problems , 1985, Theor. Comput. Sci..

[25]  Zevi Miller,et al.  A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs , 1986, Aegean Workshop on Computing.

[26]  Mihalis Yannakakis,et al.  Linear and Book Embeddings of Graphs , 1986, Aegean Workshop on Computing.

[27]  Fillia Makedon,et al.  Topological Bandwidth , 1983, CAAP.

[28]  John A. Ellis.  Embedding Rectangular Grids into Square Grids , 1988, AWOC.

[29]  Ivan Hal Sudborough.  Bandwidth Constraints on Problems Complete for Polynomial Time , 1983, Theor. Comput. Sci..

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Francis Y. L. Chin,et al.  On Embedding Rectangular Grids in Hypercubes , 1988, IEEE Trans. Computers.

[32]  I. Havel.  On Hamiltonian circuits and spanning trees of hypercubes , 1984 .

[33]  Stavros S. Cosmadakis,et al.  The Complexity of Minimizing Wire Lengths in VLSI Layouts , 1987, Inf. Process. Lett..

[34]  Frank Thomson Leighton,et al.  Reconfiguring a hypercube in the presence of faults , 1987, STOC.

[35]  Zevi Miller,et al.  Embedding Grids into Hypercubes , 1988, AWOC.