Skip to main content
Article thumbnail
Location of Repository

Embeddings in parallel systems

By 

Abstract

Graduation date: 199

Year: 1993
OAI identifier: oai:ir.library.oregonstate.edu:1957/35629
Provided by: ScholarsArchive@OSU

Suggested articles

Citations

  1. (1987). A group-theoretic model for symmetric interconnection networks",
  2. A theoretical Basis for the Analysis and Partitioning of Regular SW Banyan ",
  3. (1981). Analysis of Chordal Ring Network",
  4. (1988). Architecture and applications of the Connection machine",
  5. Banyan Networks for Partitioning Multiprocessor Systems",
  6. (1991). Coding theory, hypercube embeddings, and fault tolerance",
  7. (1990). Decomposition Into Cycles I : Hamiltonian Decompositions", Cycles and Rays,
  8. (1988). Dilation-2 embeddings of grids into hypercubes",Proc.
  9. (1991). Dilation-6 embeddings of 3-dimensional grids into optimal hypercubes",
  10. (1988). Distributed Fault Tolerant Embeddings of Binary Trees and Rings in hypercubes",
  11. (1991). Distributed fault-tolerant embeddings of rings in hypercubes",
  12. (1989). Dynamic tree embeddings
  13. (1991). Efficient embeddings and simulations for hypercube networks", phD thesis,
  14. (1991). Efficient embeddings of trees in hypercubes",
  15. (1989). Embedding arbitrary binary trees in a hypercube",
  16. (1990). Embedding hamiltonians and hypercubes in star intercinnection graphs",
  17. (1991). Embedding mesh of trees in the hypercube",
  18. (1990). Embedding meshes in boolean cubes by graph decomposition",
  19. (1990). Embedding Networks With Ring Connections in Hypercube Machines",
  20. (1989). Embedding of d-dimensional grids into optimal hypercubes",
  21. (1991). Embedding of grids into optimal hypercubes",
  22. Embedding of rings and meshes onto faulty hypercubes",
  23. (1985). Embedding of tree networks into hypercubes",
  24. Embedding rectangular grids into square grids with dilation two",IEEE Trans.
  25. (1991). Embedding shuffle networks in hypercubes",
  26. (1990). Embedding three-dimensional meshes in boolean cubes by graph decomposition",
  27. (1987). Embeddings among toruses and meshes",
  28. (1990). Embeddings in incomplete hypercubes",
  29. Embeddings of schuffle-like graphs in hypercubes",
  30. (1972). Error Correcting
  31. (1990). Falult Tolerant Embedding of Rings in the Hypercube",
  32. Fault-Tolerant embeddings of rings, meshes, and tori in hypercubes",
  33. (1984). Graph problems on a mesh-connected processor array",
  34. (1981). Graphs, Networks, and Algorithms", Wiley Interscience Publication,
  35. (1990). Group action graphs and parallel architectures ",
  36. (1984). Group Graphs as interconnection networks",
  37. (1988). Hambrusch " Embedding complete binary trees into butterfly networks", Dept of computer science,
  38. Hamiltonian cycles in the shuffleexchange network",
  39. (1989). Hypercube Embedding Heuristics: An Evaluation",
  40. Hypertree: A Multiprocessor Interconnection Topology",
  41. (1987). INTEL scientific computers, Direct connecter routing solves node communication challenge, iSCurrents,
  42. (1992). Introduction to Parallel algorithms and Architectures :
  43. Lee distance and Topological properties of k-ary n-cubes", submitted to Supercomputing 93.
  44. On embedding Rectangular Grids in Square Grids",
  45. (1988). On multidimensional arrays of processors",
  46. (1990). On the computational equivalence of hypercube-derived networks",
  47. (1987). On the embedding of arbitrary meshes in boolean cubes with expansion two dilation two",
  48. (1991). On the existence of Hamiltonian Circuits in Faulty Hypercubes",
  49. (1990). Optimal embeddings of the butterfly -like graphs in the hypercube",
  50. (1988). Optimal simulations between mesh-connected arrays of processors",
  51. (1988). Optimal simulations by butterfly networks",
  52. (1986). Optimal simulations of tree machines", 27th annual symposium on foundations of computer science,
  53. (1988). Optimum Broadcasting and Personalized Communication in Hypercubes",
  54. (1989). Parallel and Distributed Computation",
  55. (1981). Parallel Matrix and Graph Algorithms",
  56. (1987). Processor Allocation in an N-Cube Multiprocessor Using Gray Code",
  57. (1990). Product Networks: A Unified Theory of Fixed Interconnection Networks,"
  58. (1993). Properties and Communication Algorithms for K-ary n-cube Interconnection Networks",
  59. (1991). Routing multiple paths in hypercubes",Proc. of annual ACM symposium on parallel algorithms, and architectures",
  60. (1988). Simulating binary trees on hypercubes",
  61. (1979). Single-chip computers, the new VLSI building blocks.",
  62. (1986). Solving tree problems on a mesh-connected processor array",
  63. (1991). Subcube Allocation in Hypercube Computers",
  64. (1988). Submicron systems architecture project semiannual technical report',
  65. (1988). The architecture and programming of the Ametek Series 2010 Multicomputer",
  66. The Banyan-Hypercube Networks",
  67. (1991). The cube connected cycle network is a subgraph of the butterfly network",
  68. (1981). The cube-connected cycles: a versatile network for parallel computation",
  69. (1989). The I-Machine: A fine-grain concurrent computer",
  70. (1991). The J-Machine: System support for actors", in Actors: Knowledge-Based Concurrent Computing, Hewitt and Agha, Eds.
  71. (1968). The lilac W Computer",
  72. (1975). Topics in Algebra",
  73. (1990). Topological Properties of Banyan-Hypercube Networks",
  74. (1988). Topological Properties of Hypercubes",
  75. (1991). Tsitsiklis, " Optimal Communication Algorithms for Hypercubes",
  76. (1978). X-TREE : A Tree Structured Multiprocessor Computer Architecture",

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.