Implementation of a 512 bits randomized primality test is a project which implements with Google Benchmark a randomized primality test for numbers up to 512 bits.
/AAPP CHALLENGE 1 holds the detailed report of the implementation (which explains in detail also the correctness and complexity analysis) and the notebook which actually implements the test.
Mark: 3/3
The challenge aimed to implements a MPI parallel program to extract the top-1% molecules out of a given set. My solution was implementing a parallel logarithmic-merge with a "round skip" technique to safely manage even "not power of 2" set of molecules. The source code can be found at /AAPP CHALLENGE 2/main.cpp.
Mark: 3/3