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

OrdinaryDiffEq precompilation time is super slow #1886

Open
anandijain opened this issue Feb 28, 2023 · 1 comment
Open

OrdinaryDiffEq precompilation time is super slow #1886

anandijain opened this issue Feb 28, 2023 · 1 comment

Comments

@anandijain
Copy link
Contributor

like super uber duper mega fantastically slow. anytime anyone updates the teeny tiniest little package, we get the most exciting opportunity of watching paint dry for 10 minutes.

i realized we don't have any issues on this since the 22 seconds -> 3 megaissue, which has regressed so significantly its worth keeping something open on it.

i realize i can have Preferences, but I don't think this is sufficient, since very few "normal" users will do find and do this on their own. IIRC someone was suggesting looking into how to improve parallel precomp of individual solvers by potentially making them their own packages. yingbo was suggesting maybe removing some perform_steps! and have them just hit the fallback

is there a thread i've missed on what we can do given that 1.9 will come out soon?

@ChrisRackauckas
Copy link
Member

We're finding concrete things causing the problem, like #1885.

i realize i can have Preferences, but I don't think this is sufficient, since very few "normal" users will do find and do this on their own. IIRC someone was suggesting looking into how to improve parallel precomp of individual solvers by potentially making them their own packages. yingbo was suggesting maybe removing some perform_steps! and have them just hit the fallback

The issue is something to do with inference in the auto-switch algorithm If you open up Cthulhu and help ensure every dynamic dispatch is handled by branching then I think the majority may go away.

And there's JuliaLang/julia#48821 which gives exponential growth in the time to compile things with the integrator type due to type intersection calculations O(2^n). Cody is taking a look at that.

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

No branches or pull requests

2 participants