Evolution of a Parallel Program
Problem Description
In order to give a reasonably pratical example, we have chosen to
to calculate the number of prime numbers in a given range of
integers. The proposed solution is neither intended to be efficient
nor crafty, but is intended to be simple, clear and yet exhibit the
efficacy of the available hardware to perform costly calculation on
high performance hardware.
This intention is reiterated by our attempt to keep the segments of
the algorithm that do the computation modular and hopefully easily
separable from the rest of the code. Our intention is to help suggest
an approach that may be useful regarding efforts to parallelize an otherwise
serial program.