Properties of the Computation ...
Addition and multiplication are associative
Each position cij in the result is the sum of the ith row times the jth column ... all of them could be computed simultaneously
Each position admits plenty of parallelsim ...
- All multiplys in row i?j column are independent
- Sum of products could use binary addition tree
Notice that ideas from sequential complexity theory such as
Strassen’s Algorithm, that reduces the number of multiplications
from O(n3) to O(n2.81), do not apply. Concurrency counts here!