GPU Computing with CUDA

More documents

Recommendations

Info

Performance = Parallelism Efficiency = Locality
Scientific Applications Large data sets Lots of parallelism Increasingly irregular (AMR) Irregular and dynamic data structures Requires efficient gather/scatter Increasingly complex models Lots of locality Global solution sometimes bandwidth limited Less locality in these phases
Page 1 and 2: The Future of GPU Computing Bill Da
Page 3 and 4: Outline Single-thread performance i
Page 5 and 6: Moore’s Law Moore, Electronics 38
Page 7 and 8: The End of ILP Scaling 1e+7 1e+6 1e
Page 9 and 10: Performance (vs. VAX- Single-Thread
Page 11 and 12: Chips are power limited and most po
Page 13 and 14: 4,000 64b FPUs fit on a chip 64b FP
Page 15: Chips are power limited Most power
Page 19 and 20: Exploiting parallelism and locality
Page 21 and 22: Optimize use of scarce bandwidth Pr
Page 23 and 24: Fermi
Page 25 and 26: CUDA Abstracts the GPU Architecture
Page 27 and 28: 146X Interactive visualization of v
Page 29: Ease of Programming Source: Nicolas
Page 32 and 33: CPU scaling ends, GPU continues Sou
Page 34 and 35: Energy and Power Challenge Heteroge
Page 36 and 37:
Conclusion
show all

GPU Computing with CUDA

Create successful ePaper yourself

Delete template?

Save as template?