PPT Slide
i j k AND j i k
cobegin i : ə : n>
cobegin j : ə : n>
cobegin k : ə : n>
temp (i, j, k) := b(i, k) * c(k, j)
coend
a(i, j) := innersum (temp (i, j, 1 : n))
innersum = cascade partial sum
(tree algorithm)
coend
coend
1. Compute all intermediate products in parallel - n3 parallelism.
2. Compute each final result with an invocation of a tree sum.
Previous slide
Next slide
Back to first slide
View graphic version