Prime-Searching-Through-Multiple-Processes | prime numbers in a given range using multiple processes

Prime-Searching-Through-Multiple-Processes is a C++ library. Prime-Searching-Through-Multiple-Processes has no bugs, it has no vulnerabilities and it has low support. You can download it from GitHub.

this project's aim is to calculate all prime numbers in a given range using multiple processes. -root: is the beginning of the program. arguments given are "lower bound" (-l), "upper bound" (-u) and "number of children processes" (-w). this process creates 'w' child processes and distributes the number range evenly among them. when the prime calculations are over, it combines the data and outputs them to the user. -inner: are the intermediate step of the program, these are the processes created by root. each one of them has a different sub-range of the range given as an argument to root. once initialized, they create 'w' child processes (each) and distribute the range among those child processes even further. they combine the prime calculations done by their children and through a pipe, send the data to root. -worker: these are the final "layer" of processes in our program. they are assigned a certain range of numbers by their parent (inner) process and are "given" a specific prime-finding algorithm. for each number in the range they evaluate (through the algorithm) whether that number is a prime or not. whenever they find a prime, they send it to their parent using a pipe. to sum up, root creates 'w' inners and those inners create 'w'