Simplify and optimize mGPU tile intersection sort (#258)

1. Add prefetching for input and output keys and values for radix sort
to avoid page faults
2. Avoid forking threads for radix sort merging to avoid pthread
overhead

Reduces time per iteration by about 2ms

Signed-off-by: Matthew Cong <mcong@nvidia.com>

Author: matthewdcong