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

Create new sparse matrix for R factor in sparse least square solve #30289

Merged
merged 1 commit into from
Dec 7, 2018

Conversation

andreasnoack
Copy link
Member

instead of using a view to avoid slow fallback in back substitution.

Fixes #30288

instead of using a view to avoid slow fallback in back substitution.

Fixes #30288
@andreasnoack
Copy link
Member Author

@nanosoldier runbenchmarks("sparse solves", vs = ":master")

@andreasnoack andreasnoack added performance Must go faster linear algebra Linear algebra sparse Sparse arrays backport pending 1.0 labels Dec 6, 2018
@nanosoldier
Copy link
Collaborator

Your benchmark job has completed, but no benchmarks were actually executed. Perhaps your tag predicate contains misspelled tags? cc @ararslan

@andreasnoack
Copy link
Member Author

What is the predicate to run the sparse solves in the sparse benchmark group?

@KristofferC
Copy link
Member

I don't think Nanosoldier has been updated with your recent PR anyway.

@ararslan
Copy link
Member

ararslan commented Dec 6, 2018

Oh, do the benchmarks need to be updated and retuned? If so I can do that now.

@andreasnoack
Copy link
Member Author

@nanosoldier runbenchmarks("sparse", vs = ":master")

@ararslan
Copy link
Member

ararslan commented Dec 6, 2018

You need backticks. @nanosoldier runbenchmarks("sparse", vs=":master")

@andreasnoack
Copy link
Member Author

Oops. Didn't see your comments before commenting again. I thought that nano just pulled from BaseBenchmarks master. Would that be impossible? It would be nice if you could easily add a benchmark and make use of it when you realize something isn't covered.

@ararslan please just cancel the latest run if possible.

@KristofferC
Copy link
Member

The benchmarks also go through a "tuning" process.

@andreasnoack
Copy link
Member Author

You need backticks.

I make that copy-paste error almost every time. However, the benchmarks should only be run once the new ones I added are actually included in nano's portfolio.

@ararslan
Copy link
Member

ararslan commented Dec 6, 2018

please just cancel the latest run if possible.

It's a PITA so I'll just let it run. I'm retuning the benchmarks with your updates now and I'll trigger a new job here once everything is updated. EDIT: FYI it is not a fast process.

@nanosoldier
Copy link
Collaborator

Your benchmark job has completed - possible performance regressions were detected. A full report can be found here. cc @ararslan

@KristofferC KristofferC mentioned this pull request Dec 6, 2018
61 tasks
@ararslan
Copy link
Member

ararslan commented Dec 7, 2018

Things are all updated now. @nanosoldier runbenchmarks("sparse", vs=":master")

@nanosoldier
Copy link
Collaborator

Your benchmark job has completed - possible performance regressions were detected. A full report can be found here. cc @ararslan

@andreasnoack
Copy link
Member Author

@ararslan Thanks for updating nano. The constructor regressions must be spurious and the extra memory usage in the sparse solves is expected since we now create a new sparse array instead of using a view.

@andreasnoack andreasnoack merged commit 87c5f36 into master Dec 7, 2018
@andreasnoack andreasnoack deleted the an/fastsparselsq branch December 7, 2018 09:18
KristofferC pushed a commit that referenced this pull request Dec 7, 2018
…30289)

instead of using a view to avoid slow fallback in back substitution.

Fixes #30288

(cherry picked from commit 87c5f36)
KristofferC pushed a commit that referenced this pull request Dec 12, 2018
…30289)

instead of using a view to avoid slow fallback in back substitution.

Fixes #30288

(cherry picked from commit 87c5f36)
KristofferC pushed a commit that referenced this pull request Feb 11, 2019
…30289)

instead of using a view to avoid slow fallback in back substitution.

Fixes #30288

(cherry picked from commit 87c5f36)
KristofferC pushed a commit that referenced this pull request Feb 20, 2020
…30289)

instead of using a view to avoid slow fallback in back substitution.

Fixes #30288

(cherry picked from commit 87c5f36)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
linear algebra Linear algebra performance Must go faster sparse Sparse arrays
Projects
None yet
Development

Successfully merging this pull request may close these issues.

5 participants