Completed initial implementation of parallel sort.  It uses an in-place ...

...merge sort implemented with parallel block exchange.  The time limit isn't set up yet, but all the parallel algorithms are cancellable.
@bsoetaer 
I think we are over-merging, You merge subsets of the current array here but each of the sort threads are also calling merge on subsets of the values.