ParallelEulerNumberCalculation

Usage

• -q - If passed program doesn’t print to the STDOUT(not fully implemented).
• -p {integer} - Number of members of the sequence to be summed up.(default = 3000)
• -t {integer} - Number of processes to be used.(default = 1)
• -o {name of file} - File in which the output will be saved(default = './eulerNumCalculation_{timestamp}.txt')
• -g {integer} - Granularity of the data, data is split into p/(t*g) pices before computation.(default = 1)

Example call from cmd for 10 000 members of the partial sum executed with 8 processes with output saved to C:\Temp\tmp.txt:

python3 parallel_euler_number.py -p 10000 -t 8 -o C:\Temp\tmp.txt

NOTE: Current precision of the output number is set to 100 000 this should cover partial sums up to around 7000 members. Will add parameter to command line call in future.

Some test results

NOTE: The precision in the graphs is the number of acurate digits in the euler number(it is not the number of member of the partial sum)

Code was run on the following machine:

• Model: Intel Xeon CPU E5-2660 2.20 GHz
• Architecture: 64 bit
• CPU(s): 32
• Number of processors: 2 physical
• RAM: 64GB