Issue No. 08 - August (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.947002
<p><b>Abstract</b>—We present a compiler technique, which is based on Shasha and Snir's delay set analysis, to hide the underlying relaxed memory consistency model for an optimizing compiler for explicitly parallel programs. The compiler presents programmers with a sequentially consistent view of the underlying machine, irrespective of whether it follows a sequentially consistent model or a relaxed model. To hide the underlying relaxed memory consistency model and to guarantee sequential consistency, our algorithm inserts fence instructions by identifying memory-barrier nodes. We reduce the number of fence instructions by exploiting the ordering constraints of the underlying memory consistency model and the property of fence and synchronization operations. We introduce dominators with respect to a node in a control flow graph to identify memory-barrier nodes and show that minimizing the number of memory-barrier nodes is NP-hard </p>
Sequential consistency, relaxed memory consistency, dominator, synchronization, fence, NP-hard, compiler.
J. Lee and D. Padua, "Hiding Relaxed Memory Consistency with a Compiler," in IEEE Transactions on Computers, vol. 50, no. , pp. 824-833, 2001.