This is an implementation of parallel quick sort algorithm with MPI
Given a input, an integer N
, generates N
32-bit non-negative integers randomly and saves to a file the generated numbers in non-decreasing order (ascending order).
Please read approach.
-
Compile
make qs_mpi
-
Run
mpirun -np <p> ./qs_mpi <N> <output>
p
- the number of processesN
- Noutput
- the output file
- Chapter 9.4 Quicksort from Introduction to Parallel Computing By Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar