Efficient implementation of GPGPU synchronization primitives on CPUs

Authors:
Jayanth Gummaraju;Ben Sander;Laurent Morichetti;Benedict Gaster;Lee Howes
Affiliations:
Advanced Micro Devices, Sunnyvale, CA, USA;Advanced Micro Devices, Sunnyvale, CA, USA;Advanced Micro Devices, Sunnyvale, CA, USA;Advanced Micro Devices, Sunnyvale, CA, USA;Advanced Micro Devices, Sunnyvale, CA, USA
Venue:
Proceedings of the 7th ACM international conference on Computing frontiers
Year:
2010

Citing 2
Cited 0

Brook for GPUs: stream computing on graphics hardware

ACM SIGGRAPH 2004 Papers
On dynamic load balancing on graphics processors

Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware

Quantified Score

Hi-index	0.00

Visualization

Abstract

The GPGPU model represents a style of execution where thousands of threads execute in a data-parallel fashion, with a large subset (typically 10s to 100s) needing frequent synchronization. As the GPGPU model evolves target both GPUs and CPUs as acceleration targets, thread synchronization becomes an important problem when running on CPUs. CPUs have little hardware support for synchronization and must be emulated in software, reducing application performance. This paper presents software techniques to implement the GPGPU synchronization primitives on CPUs, while maintaining application debug-ability. Performing limit studies using real hardware, we evaluate the potential performance benefits of an efficient barrier primitive.