Programming Heterogeneous Parallel Computing Systems(More about event)
tudying many current GPU computing applications, we have learned that the limits of an application's scalability are often related to some combination of memory bandwidth saturation, memory contention, imbalanced data distribution, or data structure/algorithm interactions. Successful GPU application developers often adjust their data structures and problem formulation specifically for massive threading and executed their threads leveraging shared on-chip memory resources for bigger impact. We looked for patterns among those transformations, and here present the seven most common and crucial algorithm and data optimization techniques we discovered. Each can improve performance of applicable kernels by 2-10X in current processors while improving future scalability.
Audience: Graduate students, researchers and technical staff
Location: 349 Lewis Library
Date/Time: 07/10/12 at 4:30 pm - 07/13/12 at 6:00 pm