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
Parallelize greedy algorithm #155
Conversation
distribute -> push distribute_array -> scatter_array distribute_list -> scatter_list
and use DummyPool to have only on code path for both the sequential and parallel case.
else: | ||
logger.info('Using pool of {} workers for parallel greedy search'.format(len(pool))) | ||
|
||
with RemoteObjectManager() as rom: |
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.
rom
may be a misleading name in the context of model reduction (reduced order model), but it is probably unproblematic in this local context...
|
With #148 merged, I would propose to merge this one as well. I guess, the implementation could still use some testing, but it gets more testing if its in master and 0.4 is still some way ahead ... |
agreed, go ahead |
This pull request contains the (updated) parallelized version of
pymor.algorithms.greedy
from the pymor-paper branch.