Adds a pool to the reconstruction
Adds a pool option to the reconstruction of the marginalized parameters
This also adds a generic npool
interface to multithreading which will work with both dynesty
and ptemcee
current implementations via the equivalent kwargs.
Merge request reports
Activity
- Automatically resolved by Gregory Ashton
- Resolved by Gregory Ashton
- Automatically resolved by Gregory Ashton
- Resolved by Colm Talbot
@colm.talbot I reverted your proposed change from map to map. I tested the proposal and by itself, it errors out. This is because
imap
returns a generator. You can remedy this by wrapping it in alist()
. However, I noticed in the documentation forimap
it saysEquivalent of
map()-- can be MUCH slower than
Pool.map().
So, I did a test run and found thatmap
takes 03:23, imap (with a list wrap) took 05:47. For this reason I think we should keep with themap
.
mentioned in merge request bilby_pipe!325 (merged)
- Resolved by Gregory Ashton
Okay, I've run a few more involved checks using the marginalized_likelihood.py example. Here is the posterior running with npool=1 and npool=4
run sampling time reconstruction time npool=1
36s 10m 15s npool=4
14s 2m 18s And this is the posterior confirming that things get generated correctly.
Finally, I ran with a reference frequency of 35Hz and double-checked that the
result.posterior['reference_frequency']
is indeed 35Hz. (This was a bug that afflicted pbilby when we implemented parallelization of the reconstruction).changed milestone to %0.6.8
mentioned in commit 775d682a