An efficient multi-dimensional grids reconfiguration algorithm on hypercube

No abstract is available for this paper.

• Publication year

  1988

• Venue

  [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers

• Publication date

  1988-06-27

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/FTCS.1988.5345
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Loops and Multi-Dimensional Grids on Hypercubes Mapping and Reconfiguration Algorithms

  1988cited by this paper
• Topological properties of hypercubes

  1988cited by this paper
• Reconfiguring a hypercube in the presence of faults

  1987cited by this paper
• How Robust Is the n-Cube? (Extended Abstract)

  1986cited by this paper
• The cosmic cube

  1985cited by this paper
• Embedding of tree networks into hypercubes

  1985cited by this paper
• Reliable Loop Topologies for Large Local Computer Networks

  1985cited by this paper
• Generalized Hypercube and Hyperbus Structures for a Computer Network

  1984cited by this paper
• Bitonic Sort on a Mesh-Connected Parallel Computer

  1979cited by this paper

• Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes

  1995cites this paper
• Achieving Fault Tolerance in Hypercubes

  1995cites this paper
• AN IMPROVED CHARACTERIZATION OF I-STEP RE OVERABLE EMBEDDINGS: RINGS IN HYPERCUBES F

  1994cites this paper
• Reconfiguration of Rings and Meshes in Faulty Hypercubes

  1994cites this paper
• High Performance Software Reconfiguration in the Context of Distributed Systems and Interconnection Networks.

  1993cites this paper
• Reconfiguration of binary trees in faulty hypercubes

  1993cites this paper
• A Distributed Recovery Block Approach to Fault-Tolerant Execution of Application Tasks in Hypercubes

  1993cites this paper
• Parallel Computing on Distributed Memory Multiprocessors

  1993cites this paper
• Fault Tolerance in Hypercubes

  1993cites this paper
• Embedding and reconfiguration of binary trees in faulty hypercubes

  1992cites this paper
• Free dimensions-an effective approach to achieving fault tolerance in hypercube

  1992cites this paper
• On the reconfigurability of embedded loops on hypercubes and its application

  1992cites this paper
• A Divide and Conquer Ring Embedding Scheme in Hypercubes with Efficient Recovery Ability

  1992cites this paper
• Quick Recovery of Embedded Structures in Hypercube Computers

  1990cites this paper
• Reconfiguring embedded task graphs in faulty hypercubes by automorphisms

  1990cites this paper
• Eine senderanonyme fehlertolerante Kommunikationsstruktur

  1989cites this paper