Radix sort for vector multiprocessors
Marco Zagha, Guy E. Blelloch · 1991
We have designed a radix sort algorithm for vector multiprocessors and have implemented the algorithm on the CRAY Y-MP.On one processor of the Y-MP, our sort is over 5 times faster on large sorting problems than the optimized library sort provided by CIZAY Research.On eight processors we achieve an additional speedup of almost 5, yielding a routine over 25 times faster than the library sort.Using this multiprocessor version, we can sort at a rate of 712 01991