Implement Distributed Mergesort

See Shared Memory and Semaphores for a description of how to obtain and use shared memory and semaphores in Unix.

Your code is to be written in C

Citing of References

If you use any references other than what is on this web site, you must provide a complete citation in the header comments of your code. If watch videos, look at web sites, anything other than what you have been given, you must cite it. Failure to do so will result in a 0 for the assignment.

An average of 68 on programming assignments is required to pass CS326.

Concurrent Mergesort is an assignment from a few years ago. If you implement this program and get 100 percent on it, the grade will replace your lowest grade from the first three programming assignments: Pipes, Producer/consumer, or the Arm Wrestler. You must receive 100 percent on it. This cannot be used to replace one of the last two programs.

Concurrent Mergesort is significantly simpler than all of the other programs. Therefore, you earn must 100 percent to be of benefit to you.

Last Modified 4/5/2025