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.

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

Benchmark for backsolve of sparse hermitian matrices #68

Merged
merged 2 commits into from
Mar 30, 2017

Conversation

ranjanan
Copy link
Contributor

A = sprand(10^4, 10^4, 1e-4)
A = A + A' + speye(10^4)
@assert ishermitian(A)
b = rand(10^4)
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Can you use BaseBenchmark.RandUtils to construct these arrays instead of calling an unseeded rand/srand?

# Backsolve #
#############

g = addgroup!(SUITE, "backsolve")
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Instead of adding a new benchmark group here, it probably makes sense to just add this to the group where backsolve is normally tested, which you can do by following a pattern similar to here.

* Use BaseBenchmarks random number generation
* Add benchmark to Linalg arithmetic
@tkelman
Copy link
Contributor

tkelman commented Mar 30, 2017

@jrevels is this okay now?

@jrevels jrevels merged commit f38a48d into JuliaCI:master Mar 30, 2017
@jrevels
Copy link
Member

jrevels commented Mar 30, 2017

I'll kick off the tuning process now, and comment here when it's done.

@jrevels
Copy link
Member

jrevels commented Mar 30, 2017

This benchmark should now be available via Nanosoldier.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants