Towards shared memory consistency models for GPUs

Authors:
Tyler Sorensen;Ganesh Gopalakrishnan;Vinod Grover
Affiliations:
University of Utah, Salt Lake City, UT, USA;University of Utah, Salt Lake City, UT, USA;NVIDIA, Santa Clara , CA, USA
Venue:
Proceedings of the 27th international ACM conference on International conference on supercomputing
Year:
2013

Citing 4
Cited 0

The Murphi Verification System

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
A Primer on Memory Consistency and Cache Coherence

A Primer on Memory Consistency and Cache Coherence
Fences in weak memory models

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Correct and efficient work-stealing for weak memory models

Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the widespread use of graphical processing units (GPUs), it is important to ensure that programmers have a clear understanding of their shared memory consistency model, i.e. what values can be read when issued concurrently with writes. Compared to CPUs, GPUs present different shared memory behavior, and we know of no published formal consistency model for them. To fill this void, we establish a formal state transition model of GPU loads, stores, and fences in the language Murphi, and check properties -- captured in litmus tests that pertain to ordering and visibility properties -- over executions using the Murphi model checker.