Go backward to
SIMD Cube Matrix Multiplication
Go up to
Top
Go forward to
SIMD Hypercube Matrix Multiplication
SIMD Hypercube Mat. Multiplication
$d$
-dimensional hypercube
$=>$
processors indexed with
$d$
bits.
$p$
_{1}
and
$p$
_{2}
differ in
$i$
bits
$=>$
shortest path between
$p$
_{1}
and
$p$
_{2}
has length
$i$
.
Author:
Wolfgang Schreiner
Last modification: November 15, 1996