SEE: Guide to Download University of Illinois Video Lecture
Lecture Details :
The GPU architecture is characterized by memory access bandwidth that, although fast, is often limiting in comparison to compute throughput. Thus, achieving performance critically depends on finding ways to reduce and regularize global memory access. Three important algorithmic strategies for conserving bandwidth are “register/memory tiling”, “layout transformation” and “thread coarsening”. These come at a cost of increased on-chip memory usage, which is also a limited resource. We will discuss a variety of examples from PDE solvers, linear algebra, and convolution.
Course Description :
Course Description not available
Other Resources :
Other Programming Courses
- OOPs In Java,Fall 2011 by Other
- COP 2220 C Programming by Other
- C++ Programming by Other
- PHP Programming by Other
- C++ Programming I by Other
- Multicore Programming Primer by MIT
- Object-Oriented Design in Java I by Other
- iPhone Application Development,Spring 2012 by Other
- Python by Other
- Computer Science E-76: Building Mobile Applications by Harvard
» check out the complete list of Programming lectures
Programming Lecture Notes
- CSE 505 Concepts of Programming Languages by University of Washington
- CSE 401 Introduction to Compiler Construction by University of Washington
- CSE 403 Software Engineering by University of Washington