You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Nov 18, 2023. It is now read-only.
While working on #56, I saw that for every testable matrix size, multStrassen is /much/ slower than any other multiplication method. Also, for sizes > 256, the benchmark cannot finish because the memory used is too much (I saw the binary hang and use > 4GB).
Maybe there is a space leak somewhere that should be fixed, or if the algorithm is inherently slow, it could be removed from the API to not confuse the users.
The text was updated successfully, but these errors were encountered:
While working on #56, I saw that for every testable matrix size,
multStrassen
is /much/ slower than any other multiplication method. Also, for sizes > 256, the benchmark cannot finish because the memory used is too much (I saw the binary hang and use > 4GB).Maybe there is a space leak somewhere that should be fixed, or if the algorithm is inherently slow, it could be removed from the API to not confuse the users.
The text was updated successfully, but these errors were encountered: