This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: dixsort1 radixsort 1 Radix Sort—Symbols Symbols RadixSort Specific n Number of elements to sort. 2 20 Number of elements used in examples here. h Number of bits in bin. 4 Meaning there are 2 4 = 16 bins in example histogram. k Number of bits in sort key. 32 e Number of array elements per thread. 4 Based on efficient techniques to find prefix sum in a block. dixsort1 EE 77002 Lecture Transparency. Formatted 11:31, 15 April 2011 from setradix. radixsort 1 dixsort2 radixsort 2 Other Symbols M Number of multiprocessors. 16 A medium sized CC 1.0 device, also a convenient power of 2. G Number of blocks in the grid. 4 M = 64 Choose so that there are four blocks per MP, which is the maximum number of active blocks. B Number of threads in a block. 256 p Number of CUDA cores. p = braceleftBigg 8M for compute capability 1 . ≤ i ≤ 1 . 3 32M for compute capability 2.0 48M for compute capability 2.1 dixsort2 EE 77002 Lecture Transparency. Formatted 11:31, 15 April 2011 from setradix. radixsort 2 dixsort3 radixsort 3 Derived Quantities: k h Number of global iterations. 32 4 = 8 eB Number of elements per tile. 4 × 256 = 1024 n eB Number of tiles in the array....
View
Full
Document
This note was uploaded on 01/03/2012 for the course EE 7700 taught by Professor Staff during the Spring '08 term at LSU.
 Spring '08
 Staff

Click to edit the document details