Extended Due Date: Thursday November 12, 2015
Assignment:
Parallelize the following version of an integer sorting algorithm program for n numbers using OpenMP parallel regions. Your implementation should be as efficient as you can make it. The input should be a set of n integers. Each number should be in the range [0,n-1], preferably uniformly distributed in the interval [0,n-1}] You should verify that the solution is correct independent of the number of cores used, that is it should give the same correctly sorted array whether the number of cores(threads) is 1, 2, 3 etc up to 8.
This assignment is an individual assignment, to be done on your own without help from other students in the class. However, you may use any materials from any written resource, including web resources.
Instructions for submitting the homework using svn are contained in this file.