A cache-conscious, recursive Radix sort, based on a research paper read for CS 498 - Parallel Programming (Spring 2013).
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
.gitignore
Makefile
README.md
radix.c
test_radix.c

README.md

cache_conscious_radix

A cache-conscious, recursive Radix sort, based on a research paper read for CS 498 - Parallel Programming (Spring 2013) at UIUC.

This is my adaptation of a research paper - http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1183573

There is much room for improvement, and there is not much speedup in this version.

Building

Run:

make

The command make radixclang will compile using clang.

The command make clean will remove the binary.

Usage

Create a "numbers.txt" file with 1 number per line. Then, run:

./radix [# of lines to sort in the file]