Answers are grounded in this paper and cite their sources.
Reducing biases affecting galaxy observations, in particular their distance measurements, is crucial in astrophysics. This can, for example, help to estimate the value of the Hubble constant which controls the Universe expansion. We focus here on the performance optimization of a Fortran 90 code, minimizing biases in galaxy distance measurement catalogs thanks to a simulated annealing algorithm embedded within a Metropolis–Hastings sampling. We first rewrite this code in Julia to benefit from high-level programming without compromising on performance. We then introduce several numerical and algorithmic improvements, which enable us to strongly reduce the sequential computation time. Finally, we design and implement a multi-thread algorithm which manages to exploit the potential parallelism of the Metropolis–Hastings sampling, while preserving data dependencies. Performance tests show the efficiency and scalability of our parallel Julia code on up to 32 CPU cores, considering up to 400K galaxies.
No takes yet. Share an insight, caveat, or question.
Petrault et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: