Introduction to Parallel Programming hands-on programming lab – Recursive Quicksort

This hands-on exercise lab, Quicksort, is a programming lab associated with the video lecture “Implementing a Task Decomposition” (Part 9) from the “Introduction to Parallel Programming” series. This problem seeks to parallelize the recursive implementation of the Quicksort algorithm with a task decomposition solution. The lab contents include source files and written instructions to guide the programmer in converting the serial source code into an equivalent parallel version using OpenMP. Solution source files and a walk through solution video are provided to explain how the initial serial codes can be transformed into equivalent parallel source codes. An explanation of the serial source code and algorithm, some potential problems to be avoided and alternative approaches to implementing parallelism are discussed within the walk through video.

Solution video running time: 20:52

There are downloads available under the Creative Commons License license. Download Now

Include in RSS: 

For more complete information about compiler optimizations, see our Optimization Notice.