o Log messages should show both original and new size of the data. The speed
should be probably calculated from the former.
o Automatically tune ASORT_MIN_RADIX, ASORT_MIN_SHIFT and especially ASORT_RADIX_BITS.
o Log messages should show both original and new size of the data. The speed
should be probably calculated from the former.
o Automatically tune ASORT_MIN_RADIX, ASORT_MIN_SHIFT and especially ASORT_RADIX_BITS.
Improvements:
o Switching between direct and normal I/O. Should use normal I/O if the input is small enough.
o How does the speed of radix splitting decrease with increasing number of hash bits?
Does it help to use more bits than we need, so that we sort less data in memory?
Improvements:
o Switching between direct and normal I/O. Should use normal I/O if the input is small enough.
o How does the speed of radix splitting decrease with increasing number of hash bits?
Does it help to use more bits than we need, so that we sort less data in memory?