-
-
Notifications
You must be signed in to change notification settings - Fork 354
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
Improve performance of BSP classpath retrieval #1794
Conversation
In #1793 I already applied your suggested fix and also added a test case. It would be nice, if we can rebase this PR after #1793 is merged. I don't know how hard it would be to add a test case that shows the time spent in the (inefficient) module traversal (mentioned in #1792) in |
I applied this test case #1792 (comment) and here is the output. You can see it behaves better than before, e.g. no out of memory exception and shorter time spans, but still once the modules count with inter-dependencies goes up, there is a huge increase in runtime.
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thank you for your pull request. In the meantime I came up with a test cases which shows these performance issue. The current logic is heavily using T.task
as it depends on some non-static details from the current evaluator. But I think I've come up with another idea, how we can avoid all these ad-hoc and un-cached tasks and replace it with more granular cached targets. I'll open a PR once I have implemented it.
Even if that means, that we won't merge your PR, your work is much appreciated! It helped greatly to understand the issue and gave food for thoughts.
No problem, thanks for taking a look at this! |
@abernardi597 I opened #1803. I'd love to get your feedback for it. |
Issue reported in #1792