Hi Lydia,
the implementation looks correct. What you could do to speed up the
computation is to exploit existing partitionings in order to avoid
unnecessary network shuffles. Moreover, you could block your matrices to
increase the data granularity at the cost of parallelism.
Cheers,
Till
On Mon,
Hi Till,
thanks for your reply :)
Yes, it finished after ~27 minutes…
Best regards,
Lydia
> Am 25.01.2016 um 14:27 schrieb Till Rohrmann :
>
> Hi Lydia,
>
> Since matrix multiplication is O(n^3), I would assume that it would simply
> take 1000 times longer than the multiplication of the 100
Hi Lydia,
Since matrix multiplication is O(n^3), I would assume that it would simply
take 1000 times longer than the multiplication of the 100 x 100 matrix.
Have you waited so long to see whether it completes or is there another
problem?
Cheers,
Till
On Mon, Jan 25, 2016 at 2:13 PM, Lydia Ickler
