Despite the theoretical interest in deterministic sorting algorithms, we were able to locate relatively few empirical studies. All but one of these studies used machines which are no longer available. The single exception is the recent work of Gerbessiotis and Siniolakis [13, 12]. Table x compares the performance of their deterministic algorithm with that of our regular sampling algorithm on an IBM SP-2.
Table x: Total execution time (in seconds) to sort the [U] integer
benchmark on the IBM SP-2, comparing our results (HJB) with those
reported by Gerbessiotis and Siniolakis (GS)