Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Replace 'SparseArrays' by 'StaticArrays' #2

Closed
wants to merge 1 commit into from
Closed

Replace 'SparseArrays' by 'StaticArrays' #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions Readme.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,8 +44,8 @@ To compute any given column in $C_{(:,j)}$ of $C$ we are essentially computing a

## Benchmarking
For matrices $(N\times K)$ and $(K\times M)$ we fix $N=1'000$ and $K=2'000$ and vary N.
Here's are the benchmark results, comparing against SparseArrays.jl, which ships with Julia but is single-threaded:
Here's are the benchmark results, comparing against StaticArrays.jl, which ships with Julia but is single-threaded:

![scaling benchmark](/benchmark/scaling.png)

For all N we see a speed up over `_spmul!` from the SparseArrays package of up to ~3x for N in [300, 30_000], and ~2x otherwise.
For all N we see a speed up over `_spmul!` from the StaticArrays package of up to ~3x for N in [300, 30_000], and ~2x otherwise.