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$₁ and $p$₂ differ in $i$ bits $=>$ shortest path between $p$₁ and $p$₂ has length $i$.