[JDWolf]

Still somewhat preliminary but its a grad level course in algos and the goal is to invent a paper that can be submitted to a conference of our choice. My background is in relational databases so I have generally leaned towards optimization in that area. My initial explorations have been to use C's forking of processes and shmem to parallelize both merge and quick sorts so far on my laptop but want to extend this to generate results on different types of hardware and for different types of data sets. I hypothesize that a better understanding of caching will facilitate a lot of this optimization as many of the enterprise systems are pretty advanced in this area.

Thanks again!