# how does the parallel radix sort work?

I'm currently learning computer science, and there is a slide of notes brief described the parallel radix sort under data parallelism.

number 101 110 011 001 111 (1st bit)
order    2   1   3   4   5 (new order)
number 110 101 011 001 111 (2nd bit)
order    3   1   4   2   5 (new order)
number 101 001 110 011 111 (3rd bit)
order    3   1   4   2   5 (new order)
number 001 011 101 110 111


I roughly know how to sort it from lecturer's explanation, but how is it related to parallel computing to increase the performance?

-
Google search returned this. drdobbs.com/parallel/parallel-in-place-n-bit-radix-sort/… –  user5507 Nov 25 '12 at 13:28