John Wickerson explains our POPL 2017 paper on memory consistency
My POPL 2017 paper with Mark Batty, Tyler Sorensen, and George Constantinides is all about memory consistency models, and how we can use an automatic constraint solver to compare them. In this blog post, I will discuss:
- What are memory consistency models, and why do we want to compare them?
- Why is comparing memory consistency models difficult, and how do we get around those difficulties in our work?
- What can we achieve, now that we can compare memory consistency models automatically?
What is a memory consistency model?
Modern computers achieve blistering performance by having their computational tasks divided between many ‘mini-computers’ that run simultaneously. These mini-computers all have access to a collection of shared memory locations, through which they can communicate with one another.
It is tempting to assume that when one of the mini-computers stores some data into one of these shared memory locations, that data will immediately become visible to any other mini-computer that subsequently loads from that location…
View original post 4,172 more words