Assignment #7a (Distributed Memory Programming)

Implement the following program: Input data (by one process?) into an array X of n elements. (There are no duplicate elements in  X )

Assume that the program is run on a small cluster so that number of elements is greater than number of processes. The Head node is given the task of inputting the data into X and broadcasting it to all the processors.

Use the processes to parallel sort X using rank sorting algorithm. (i.e., every process sends the information to the root node which places that element in the correct sorted position. To avoid too many communications, each process should send all the information at one time).

Assignment #7b (Shared Memory Programming)

Input data and sort an array using Rank Sort

You must use group scheduling.

Test your program with p=6; g=2; k=3