Learning part:
Thinking part: Combine the understandings above and solve pagerank as a mapreduce problem.
Coding part:
./mr-pr-cpp.o ${filename}.txt -o ${filename}-pr-cpp.txt. Format of the output files should be exactly same as the python (${filename}-pr-p.txt) and java (${filename}-pr-j.txt) output files in the benchmark. Compare correctness of the pagrank output against the given java/python outputs. (4)./mr-pr-mpi.o ${filename}.txt -o ${filename}-pr-mpi.txt. Compare correctness of the pagerank output against the given java/python outputs. (5)./mr-pr-mpi-base.o ${filename}.txt -o ${filename}-pr-mpi-base.txt. Compare correctness of the pagerank output against the given java/python outputs. (3)Performance analysis part: Plot graphs with x-axis as benchmark ID, and y-axis as pagerank runtime, three graphs for your three executables. Compare pagerank latencies across the three implementations and comment on your observations. Prepare a 1-2 page PDF report with these graphs and observations. (3)
To submit: Submit a zip file containing the three cpp files, a Makefile that compiles the executables and the PDF.