Dynamic Synthesis for Relaxed Memory Models

Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, allowing control of this behavior. To implement a concurrent algorithm for a modern architecture, the programmer is forced to manually reason about subtle relaxed behaviors and figure out ways to control these behaviors by adding fences to the program. Not only is this process time consuming and error-prone, but it has to be repeated every time the implementation is ported to a different architecture. In this paper, the authors present the first scalable framework for handling real-world concurrent algorithms running on relaxed architectures.

Provided by: Association for Computing Machinery Topic: Software Date Added: Mar 2012 Format: PDF

Find By Topic