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
Any efficient linear algebra library requires fast matrix-matrix products. The Rust ndarray project uses the matrixmultiply library https://github.com/bluss/matrixmultiply, which uses the same ideas on which the BLIS project is based. This seems to be a very good start.
In this issue we want to track the use of matrixmultiply and its performance compared to Openblas on different architectures.
The text was updated successfully, but these errors were encountered:
Or this could be done entirely in Rust, sweeping over problem sizes for each factorization and scalar, but I'd encourage plotting it normalized to match the BLIS figures.
Any efficient linear algebra library requires fast matrix-matrix products. The Rust ndarray project uses the matrixmultiply library https://github.com/bluss/matrixmultiply, which uses the same ideas on which the BLIS project is based. This seems to be a very good start.
In this issue we want to track the use of matrixmultiply and its performance compared to Openblas on different architectures.
The text was updated successfully, but these errors were encountered: