...Bader

The support by NASA Graduate Student Researcher Fellowship No. NGT-50951 is gratefully acknowledged.

...JáJá

Supported in part by NSF grant No. CCR-9103135 and NSF HPCC/GCAG grant No. BIR-9318183.

...bandwidth

Note that throughout this paper, the rate of ``MB/s'' will always represent 10^6 bytes per second.

...times

Note that throughout this paper ``log x'' will always be the logarithm of x to the base b=2, i.e. log2(x).

...sort

Note that whenever radix sort is mentioned in this paper, the actual coding uses the standard UNIX quicker-sort function for smaller sorts, and radix sort for larger sorts, using whichever sorting method is fastest for the given input size.

...nodes

Our radix sort uses four passes; each pass will sort on one byte of the 32-bit key by using 256 buckets.

David A. Bader
dbader@umiacs.umd.edu