Kepler's SHUFFLE (SHFL): Tips and Tricks | GTC 2013

More documents

Recommendations

Info

Implement <strong>SHFL</strong> for 64b Numbers__device__ __inline__ double shfl(double x, int lane){// Split the double number into 2 32b registers.int lo, hi;asm volatile( “mov.b32 {%0,%1}, %2;” : “=r”(lo), “=r”(hi) : “d”(x));// Shuffle the two 32b registers.lo = __shfl(lo, lane);hi = __shfl(hi, lane);// Recreate the 64b number.asm volatile( “mov.b64 %0, {%1,%2};” : “=d(x)” : “r”(lo), “r”(hi));}return x;• Generic <strong>SHFL</strong>: https://github.com/BryanCatanzaro/generics
Performance Experiment• One element per threadthread:0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 …x:…• Each thread takes its right neighborthread:0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 …x:…
Page 3 and 4: Shuffle (SHFL)• Instruction to ex
Page 5: Instruction (PTX)Optional dst. pred
Page 9 and 10: Performance Experiment• Shared me
Page 11 and 12: Performance Experiment (fp64)Execut
Page 13 and 14: Broadcast• All threads read from
Page 15 and 16: Scan• Code#pragma unrollfor( int
Page 17 and 18: Bitonic Sortx:11 3 8 5 10 15 9 7 12
Page 19 and 20: Bitonic Sortint swap(int x, int mas
Page 21 and 22: Transpose• You can use SMEM to im
Page 23: Conclusion• SHFL is available for

Kepler's SHUFFLE (SHFL): Tips and Tricks | GTC 2013

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?