personalized communication and sorting algorithms presented in this paper
have been coded in Split-C and
run on a variety of platforms, including the Thinking Machines CM-5,
IBM SP-2, Cray Research T3D, Meiko Scientific CS-2, and the Intel Paragon.
Our experimental results are consistent with the theoretical analyses
and illustrate the scalability and efficiency of our algorithms across
different platforms. In fact, they seem to outperform all similar algorithms
known to the authors on these platforms, and performance is invariant
over the set of input distributions unlike previous efficient algorithms.
Our sorting results also compare favorably with those reported for the
simpler ranking problem posed by the NAS Integer Sorting (IS) Benchmark.