4 Apr
2007
4 Apr
'07
7:53 p.m.
AMDG Martin Schulz <Martin.Schulz <at> synopsys.com> writes:
I'm not sure why my simple matrix multiplication results are so much slower...the others are comparable.
This could be very well a cache size issue.
That's exactly what's happening. The basic matrix multiplication algorithm used by ublas is very cache unfriendly for large matrices. The ublas version is primarily to make sure that my implementation is correct. In Christ, Steven Watanabe