CSCI 3366
Spring 2004
Homework One
                                                                                
Using the C and MPI programming environment, write a "ring sort." Given
N processors, we may sort N numbers as follows. The first process generates
the N numbers (read a file or generate randomly or..) It passes one to
the next process in the ring. It then passes a second number to the next
process in the ring. Upon receiving two numbers, the next process passes
the larger to the next process in the ring. Each process in the ring waits
until it has received two numbers, and then it passes the larger one to
the next process in the ring. When the first process has passed all of its
numbers to the second, it simply waits until the last process in the ring
begins to send numbers to it. Of course, if all has occurred as it should,
it should receive the largest number first, then the second largest, and
so on. It simply stores (prints) the numbers as it receives them, since
they will now be in descending numerical order.
                                                                                
Homework due Tuesday, 27 Jan 04