In the spring ‘09 semester, I took the Parallel Algorithms course taught by Professor Guy Blelloch. It taught me techniques and algorithms for use with multi-core machines. In particular, the algorithmic applications that come with having a theoretically unlimited number of processors. It stretched my abilities as a software developer that will hopefully pay off as machines more commonly come with more and more cores.
I completed many assignments for the class using NESL and Cilk++.
For a final project, I wrote an implementation of a kd-tree using Cilk++ that ran an order of magnitude faster than the sequential implementation.
You must be logged in to post a comment.
Trackback URL for this entry