minimal benchmark code for Counting Set Bits (ones) in an Integer
...PS: the parallel counting Algo is about 35% faster on average on my computers than a simple LUT based solution. Also this shows nicely how different a human brain compatible solution is to a binary machine optimal solution :-)
In the meantime I added other Algorithms beside countbisset (hamming weight): ceil(log2()) + floor(log2()), bitreverse, ...
I also recommand to try the code with different compilers and / or plattforms.
PS: see result.txt in Code, to see various runs with different compilers and compiler switches
LBP implementation in multiple computing platforms (ARM,GPU, DSP...)
...This is a software toolbox that collects software implementations of the Local Binary Pattern operator in several platforms:
- OpenCL for CPU & GPU
- OpenCL for GPU (branchless)
- C code optimized for ARM
- OpenGL ES 2.0 shaders mobile GPUs
- C code for TI C64x DSP core (branchless)
- C code for TTA processor synthesis
If you use the code somewhere, please cite:
Bordallo López M., Nieto A., Boutellier J., Hannuksela J., and Silvén O.
...
An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.