Commit-Reconcile & Fences (CRF): A new memory model for architects and compiler writers

We present a new mechanism-oriented memory model called Commit-Reconcile & Fences (CRF) and define it us� ing algebraic rules. Many existing memory models can be described as restricted versions of CRF. The model has been designed so that it is both easy for architects to implement, and stable enough to serve as a target machine interface for compilers of high-level languages. The CRF model ex� poses a semantic notion of caches (saches), and decomposes load and store instructions into finer-grain operations. We sketch how to integrate CRF into modern microprocessors and outline an adaptive coherence protocol to implement CRF in distributed shared-memory systems. CRF offers an upward compatible way to design next generation computer systems