A number of sequential radix sort algorithms are given separately (in directory 508). Parallel radix-sort based on paralle-count sort is implemented in a variety of ways. Two copies of the same basic algorithm are included (one by A. Gerbessiotis and the other by S.Y. Lee) and an enhanced version (though slower in practice) by S.Y.Lee. There are two copies of these versions: one that works with one-sided communication under LAM MPI, BSPlib and PUB-Library and the other that works with two-sided communication under LAM MPI only. The code is implemented in ANSI C. (Note the allrdx.c allrdx.h code reflects earlier versions of some of above described programs that were tested under Critical Software's WMPI and may be present in the current release but with no or non safe code).
Last Update: April 19, 2004