Fast Erasure Coding Library for Large Number of Data and Parities
-
Updated
Apr 16, 2020 - C++
Fast Erasure Coding Library for Large Number of Data and Parities
Faster alternative implementations of Arrays.hashCode(byte[])
An optimized matrix multiplication library in C employing blocking, multithreading (POSIX threads), and SIMD (AVX) vectorization. It benchmarks algorithms against OpenBLAS and includes a theoretical appendix detailing the iterative optimization process.
Pure CPU Conway's Game of Life - 2,500x speedup, 100M cells in 274ms. No GPU.
Faster implementations of `Arrays.hashCode(byte[])` outperform OpenJDK 24.0.1. Run benchmarks easily and view results in this efficient Java repository. 🚀💻
To associate your repository with the simd-vectorization topic, visit your repo's landing page and select "manage topics."