Implements a simple Sieve of Eratosthenes-like algorithm concurrently to find small prime numbers.
First sync git submodules
git submodule update --init
Create a build directory
mkdir BUILD && cd BUILD
Generate build files with CMake
cmake ..
Build the executable with make
make CPPrimes
-t <n>
Run with n
threads. Default 4
-s <n>
Find numbers starting at n
. Default 2
-e <n>
Find numbers ending at n
. Default 1000
-c <n>
Configure the checkpoint size, i.e. the size of the chunks of numbers that will be processed together. Default 500