CMU 15-418 (Spring 2012) Final Project:
by Kiraz Baysal and Jen Solyanik

Project Proposal

Checkpoint Report

Final Report

Working Schedule

Week What We Plan To Do What We Actually Did
Apr 1-7Understand the math behind the CRP algorithm, and familiarize ourselves with the existing code base.We read 3 papers on the CRP algorithm and read through the code base. However, we found the codebase to be confusing and made an appointment with Prof Dyer to review the code.
Apr 8-14Begin a simple parallel implementation.Met with Prof Dyer, understood the codebase. Brainstormed possible solutions.
Apr 15-21Debugging + improving our implementationWrote two different potential implementations
Apr 22-28Slowly begin more complicated algorithms 
Apr 29-May 5Debugging debugging debugging 
May 6-11Last minute panic + wrapping the project up. 

Working Log

[Keep a log of work you have done here. You may wish to list optimizations you tried, what failed, etc. Or you can just rant. Keeping a good log will make it easy to put together your final writeup.]

April 8: Met to discuss the project. At this point we have both read papers on the subject provided by Professor Dyer, and understand the math behind the algorithm. Looked over the codebase together but didn't understand the file structure and dependencies; decided to meet with Professor Dyer to learn more. Created a pseudocode rough draft for our parallelized algorithm.

April 12: Met with Professor Dyer. Discussed the algorithm and its applications, as well as reviewed the codebase. Discussed future steps and possible parallelization techniques.

April 21: At this point, we have a simple, though buggy, parallel implementation.

April 23: Checkpoint report: written!