std_find_simd
std::find simd version (by SungJJinKang)
SIMDCompressionAndIntersection
A C++ library to compress and intersect sorted lists of integers using SIMD instructions (by lemire)
| std_find_simd | SIMDCompressionAndIntersection | |
|---|---|---|
| 2 | 1 | |
| 18 | 414 | |
| - | - | |
| 0.0 | 2.0 | |
| over 1 year ago | 10 months ago | |
| C++ | C++ | |
| MIT License | Apache License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
std_find_simd
Posts with mentions or reviews of std_find_simd.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-27.
SIMDCompressionAndIntersection
Posts with mentions or reviews of SIMDCompressionAndIntersection.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-18.
-
What scientists must know about hardware to write fast code
If you’re working with time series data and using a vectorized algorithm implemented with SIMD instructions you can achieve decompression speeds approaching 15 GB/s [1].
Anecdotally when working with biological signals at my day job, compression is a massive win and an absolute no brainer tradeoff when shuffling data across the network or even just storing in memory.
That said, I think your first point is still reasonable for certain types of data and compression algorithms.
[1] https://github.com/lemire/SIMDCompressionAndIntersection
What are some alternatives?
When comparing std_find_simd and SIMDCompressionAndIntersection you can also consider the following projects:
SortingNetworks
lzbench - lzbench is an in-memory benchmark of open-source LZ77/LZSS/LZMA compressors
Vc - SIMD Vector Classes for C++
xsimd - C++ wrappers for SIMD intrinsics and parallelized, optimized mathematical functions (SSE, AVX, AVX512, NEON, SVE))
TurboPFor - Fastest Integer Compression
highway - Performance-portable, length-agnostic SIMD with runtime dispatch