No label defined (Q4028464)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 140089
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 140089

      Statements

      0 references
      0 references
      28 March 1993
      0 references
      hypercube machine
      0 references
      multi-processor system
      0 references
      hypercube graph
      0 references
      hypercube networks
      0 references
      [For the entire collection see Zbl 0747.00033.] A \(n\)-dimensional hypercube \(Q_ n\) is a \(n\)-regular graph consisting of \(2^ n\) vertices labeled by \(n\)-bit binary strings such that two vertices are connected by an edge if and only if their binary labels are distinct in exactly one bit. A hypercube machine is a multi-processor system whose processors and data links correspond to vertices and edges of a hypercube graph, respectively. Hypercube machines have been considered ideally suitable for divide-and-conquer applications. Most importantly, hypercube networks support efficient routing algorithms and consequently can simulate many realistic parallel architectures with small overheads. Since the 64-processor Cosmic Cube built at Caltech, many hypercube machines has been designed and made commercially available.
      0 references

      Identifiers