Go backward to SIMD Hypercube Matrix Multiplication Go up to Top Go forward to Row/Column-Oriented Matrix Multiplication

SIMD Hypercube Matrix Multiplication

Tree summation in hypercube.

Processors	000	001	010	011	100	101	110	111
Step 1	r0	s0	r1	s1	r2	s2	r3	s3
Step 2	r0		s0		r1		s1
Step 3	r0				s0

• Each processor receives value from neighboring processors only.
• Only short-distance communication is required.

Cube algorithm can be more efficient on hypercube!