Profile and Speed up Monty
The current implementation of Montys algorithm is suboptimal and can be optimized. This item includes identifying computational bottlenecks and addressing them.
We have profiled Monty a while ago and identified several computational bottlenecks. Some of them have been addressed but there are still many places where the Monty algorithm could be optimized. It has also been a long time since Monty was profiled, so repeating this now would be worthwhile.
One of the most significant computational bottlenecks in Monty at the moment is the KD-Tree search, which is tracked in a separate future work item to find a faster alternative to KT-Tree search.
For the profiling and speedup efforts from back then, see the following two videos:
You can also find some further discussion and ideas in this thread on our Forum.
Help Us Make This Page Better
All our docs are open-source. If something is wrong or unclear, submit a PR to fix it!
Updated 9 days ago