Maximising Algorithm Performance in .NET: Levenshtein Distance
Vložit
- čas přidán 24. 07. 2024
- With performance tricks you may not know on an algorithm you may never have heard of before, be prepared to learn about my journey from different array structures to pointers, SIMD to threading, as we take the journey to maximum performance together.
- Věda a technologie
James, this is a fantastic demo, I loved the whole thing, a great example of a journey to improve performance to the nth degree
The JIT optimizations, and exploration of SIMD were perhaps the most enlightening.
Thank you for this
I've spent a good amount of time on optimizations for the computation, and he left a few things out. I'll release a video in a few weeks going through them (though I coded them in Python).