Modular: Understanding SIMD: Infinite Complexity of Trivial Problems - discu.eu

Hacker News

Understanding SIMD: Infinite complexity of trivial problems https://www.modular.com/blog/understanding-simd-infinite-complexity-of-trivial-problems 116 comments 25/11/2024

Lobsters

Understanding SIMD: Infinite Complexity of Trivial Problems https://www.modular.com/blog/understanding-simd-infinite-complexity-of-trivial-problems 2 comments 26/11/2024 ai , c , hardware , math , performance

Reddit

Linked pages

Fast inverse square root - Wikipedia https://en.wikipedia.org/wiki/Fast_inverse_square_root 109 comments
GitHub - ashvardanian/StringZilla: Up to 10x faster strings for C, C++, Python, Rust, and Swift, leveraging SWAR and SIMD on Arm Neon and x86 AVX2 & AVX-512-capable chips to accelerate search, sort, edit distances, alignment scores, etc 🦖 https://github.com/ashvardanian/Stringzilla 57 comments
GitHub - ashvardanian/SimSIMD: Vector Similarity Functions 3x-200x Faster than SciPy and NumPy — for Python, JavaScript, Rust, and C 11, supporting f64, f32, f16, i8, and binary vectors using SIMD for both x86 AVX2 & AVX-512 and Arm NEON & SVE 📐 https://github.com/ashvardanian/simsimd 56 comments
http://assemblyrequired.crashworks.org/timing-square-root/ 12 comments
Newton's method - Wikipedia https://en.wikipedia.org/wiki/Newton%27s_method 4 comments
GCC Compiler vs Human - 119x Faster Assembly 💻🆚🧑‍💻 | Ash's Blog https://ashvardanian.com/posts/gcc-12-vs-avx512fp16/ 1 comment

Related searches:

Search whole site: site:www.modular.com

Search title: Modular: Understanding SIMD: Infinite Complexity of Trivial Problems

See how to search.

Submit link to: