Parallel Merge Sort

In my second post I am going to talk about the popular sorting algorithm Merge Sort. The serial implementation of Merge Sort, is based on a divide and conquer approach. The data set is divided into recursively into smaller and smaller parts, i.e. the divide part, and then to conquer the data, the data is … Continue reading Parallel Merge Sort

Latency vs Throughput

I am new to Parallel Computing, new to writing blog posts, basically, I am, what they call, a “noob”. Through this blog, I plan to document my exploration, interpretation and implementation of parallel computing. I hope this serves as a reference to some student somewhere trying to get a hang of the subject, and excel at it, like … Continue reading Latency vs Throughput