Parallel Quicksort using MPI & Performance Analysis

PrasadPerera

Rate me:

4.33/5 (9 votes)

13 Sep 2009CPOL8 min read

75.5K

This is an individual effort on parallelizing the quicksort algorithm using MPI (Message Passing Interface) to sort data by sharing the partitions generated from regular sampling.

Views

Daily Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

PrasadPerera

Student

Canada

Prasad Perera is a software developer who's interested in parallel and distributed computing and graphics programming!

Currently he is following his masters in Concordia University, Montreal.

Parallel Quicksort using MPI & Performance Analysis

Views

License

Comments and Discussions