CIS 5930-04 Parallel Computing
Spring 2007
Assignment 2
Due: 6 Apr 2007
Problem: In this assignment, you will implement four parallel sorting algorithms using MPI.
Parallelization: Implement the following four parallel sorting algorithms using MPI for
communication.
1. Parallel Quicksort from section 14.3.
2. Hyperquicksort from section 14.4.
3. Parallel Sorting by Regular Sampling from section 14.5.
4. One other (comparison based) parallel sorting algorithm – you are free to choose this.
Files: You should create a directory called hw2 on the p690 at NCSA, containing the
following files:
1. sort1.c, implementing the code for #1 above.
2. sort2.c, implementing code for #2 above.
3. sort3.c, implementing code for #3 above.
4. sort4.c, implementing the code for #4 above. The top few lines of this code should
have a comment specifying the name of the algorithm used, and the reference where
you found it. You may make changes to the algorithm given in your reference, in order
to make it run faster, especially on large output.
5. sort.c, implementing the main function. This code should read command line
arguments provided by the user, call the appropriate sorting routine (as explained
below), and print the desired output (exactly as specified – there should be no extra
output).
6. Makefile, which is the makefile for this assignment. Typing make should create an
executable called sort, which is created by linking sort.o, sort1.o, sort2.o, sort3.o, and
sort4.o.
7. sort, which is the executable that I will run.
Running the code: Code will be run as follows:
poe sort <a> <n> <s> [<optional list of integers>] –procs <np>
In the above line, <np> refers to the number of processors. The algorithm to use for sorting
will be specified by <a>; <a> = 1 for the method 1, 2 for method 2, 3, for method 3, and 4
for method 4. The total number of (long) integers to sort is specified by <n>, which will be at
least 1. You should generate the random integers as follows. Use srand48 to seed the
random number generator using <s> (which is a long integer) as the seed. Then generate
<n> random integers using lrand48. (Remember to include the header file stdlib.h.) The
<n> integers should initially be divided by having each processor get floor((double)
