Implementing Finite Volume algorithms on GPUs - many-core.group ...

More documents

Recommendations

Info

What block-size should we use? (y-direction) In y direction, different effects come into play For global memory access coalesence, want to read several adjacent cells in x-direction. So, 4 × 32 is not the obvious answer Block size Overall time 16 × 8 6.93s 32 × 4 8.41s 4 × 32 6.54s 8 × 16 6.51s 8 × 32 6.45s <strong>Finite</strong> <strong>Volume</strong> Methods Laboratory for Scientific Computing 17 / 22
Performance on different sized grids Attain reasonable speed-up even on smaller grids <strong>Finite</strong> <strong>Volume</strong> Methods Laboratory for Scientific Computing 18 / 22
Page 1 and 2: Implementing <stro
Page 3 and 4: Applications of Finite</str
Page 5 and 6: Applications of Finite</str
Page 7 and 8: Shock-bubble simulation shockBubble
Page 9 and 10: Euler’s equations Flux-conservati
Page 11 and 12: Data layout in memory We use Struct
Page 13 and 14: MUSCL-Hancock scheme Piecewise-cons
Page 15 and 16: MUSCL-Hancock scheme Piecewise-cons
Page 17 and 18: Loading global data into shared mem
Page 19 and 20: Loading global data into shared mem
Page 21 and 22: Within shared memory Thread i − 1
Page 31 and 32: Thread-block layout Each cell depen
Page 33 and 34: Thread-block layout Each cell depen
Page 35 and 36: How fast? We should now check how f
Page 37 and 38: How fast? We should now check how f
Page 39 and 40: Templating over coordinate directio
Page 41: What block-size should we use? (x-d
Page 45 and 46: Summary Achieved 147x speed-up for
Page 47: Future investigations Efficient ext

Implementing Finite Volume algorithms on GPUs - many-core.group ...

Create successful ePaper yourself

Delete template?

Save as template?