Five input distributions are used to test our integer sorting algorithm.
;
bits per
key;
, and each key is the average
of four consecutive uniformly distributed
pseudo-random numbers generated by the following
recurrence:
where 
and the seed 
.
Thus, the distribution of the key values is a
Gaussian approximation. On a p-processor machine,
the first 
generated keys are assigned
to 
, the next 
to 
, and so
forth, until each processor has 
keys.