scientific article; zbMATH DE number 140089
[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.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028464)