Description of changes:
After bitonic sort is called (when the shared mem buffer gets full), we should set the minVal equal to the register that contains the smallest value (the largest numbered register since the sorting is in descending order). This has the effect of filtering out values that are smaller than the running k^th element, hence reducing the number of times we call bitonic sort.
By submitting this pull request, I confirm that my contribution is made under the terms of the Apache 2.0 license.
Description of changes: After bitonic sort is called (when the shared mem buffer gets full), we should set the minVal equal to the register that contains the smallest value (the largest numbered register since the sorting is in descending order). This has the effect of filtering out values that are smaller than the running k^th element, hence reducing the number of times we call bitonic sort.
By submitting this pull request, I confirm that my contribution is made under the terms of the Apache 2.0 license.