2019年系列讲座课件SortingandSearching.pptVIP

Sorting and Searching Timothy J. Purcell Stanford / NVIDIA Topics Sorting Sorting networks Search Binary search Nearest neighbor search Assumptions Data organized into 1D arrays Rendering pass == screen aligned quad Not using vertex shaders PS 2.0 GPU No data dependent branching at fragment level Sorting Sorting Given an unordered list of elements, produce list ordered by key value Kernel: compare and swap GPUs constrained programming environment limits viable algorithms Bitonic merge sort [Batcher 68] Periodic balanced sorting networks [Dowd 89] Bitonic Merge Sort Overview Repeatedly build bitonic lists and then sort them Bitonic list is two monotonic lists concatenated together, one increasing and one decreasing. List A: (3, 4, 7, 8) monotonically increasing List B: (6, 5, 2, 1) monotonically decreasing List AB: (3, 4, 7, 8, 6, 5, 2, 1) bitonic Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Bitonic Merge Sort Summary Separate rendering pass for each set of swaps O(log2n) passes Each pass performs n compare/swaps Total compare/swaps: O(n log2n) Limitations of GPU cost us factor of logn over best CPU-based sorting algorithms Searching Types of Search Search for specific element Binary search Search for nearest element(s) k-nearest neighbor search Both searches require ordered data Binary Search Find a specific element in an ordered list Implement just like CPU algorithm Assuming hardware supports long enough shaders Finds the first element of a given value v If v does not exist, find next smallest element v Search algorithm is sequential, but many searches can be executed in parallel Number of pixels drawn determines number of searches executed in parallel 1 pixel == 1 search Binary Search Search for v0 Binary Search Search for v0 Binary Search Search for