When: April 25, 2013 at 9am PDT
What: Learn how to optimize your algorithms for the Fermi and Kepler architectures. This informative webinar will cover the key optimization strategies for compute and memory bound problems. The session will include techniques for ensuring peak utilization of CUDA cores by choosing the optimal block size and using dynamic parallelism on the Kepler architecture. For compute bound algorithms we will discuss how to improve branching efficiency, intrinsic functions and loop unrolling. For memory bound algorithms, optimal access patterns for global and shared memory will be presented and highlighting the differences between the Fermi and Kepler architecture.
Kelly is the Training Program Manager for Acceleware. She is responsible for the development and management of all training materials. She has taught over 30 courses for students from a diverse range of industries and backgrounds. Kelly is also a member of our development team and provides consulting services to clients. Kelly has a PhD in Electrical Engineering from the University of Calgary.