Skip to main content
Synthesis Lectures on Computer Architecture

Relaxed Memory Consistency

Publication ,  Chapter
Sorin, DJ; Hill, MD; Wood, DA
January 1, 2009

The previous two chapters explored the memory consistency models sequential consistency (SC) and total store order (TSO). These chapters presented SC as intuitive and TSO as widely implemented (e.g., in x86). Both models are sometimes called strong because the global memory order of each model usually respects (preserves) per-thread program order. Recall that SC preserves order for two memory operations from the same thread for all four combinations of loads and stores (Load → Load, Load → Store, Store → Store, and Store → Load), whereas TSO preserves the first three orders but not Store → Load order.

Duke Scholars

DOI

Publication Date

January 1, 2009

Start / End Page

51 / 81
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Sorin, D. J., Hill, M. D., & Wood, D. A. (2009). Relaxed Memory Consistency. In Synthesis Lectures on Computer Architecture (pp. 51–81). https://doi.org/10.1007/978-3-031-01733-9_5
Sorin, D. J., M. D. Hill, and D. A. Wood. “Relaxed Memory Consistency.” In Synthesis Lectures on Computer Architecture, 51–81, 2009. https://doi.org/10.1007/978-3-031-01733-9_5.
Sorin DJ, Hill MD, Wood DA. Relaxed Memory Consistency. In: Synthesis Lectures on Computer Architecture. 2009. p. 51–81.
Sorin, D. J., et al. “Relaxed Memory Consistency.” Synthesis Lectures on Computer Architecture, 2009, pp. 51–81. Scopus, doi:10.1007/978-3-031-01733-9_5.
Sorin DJ, Hill MD, Wood DA. Relaxed Memory Consistency. Synthesis Lectures on Computer Architecture. 2009. p. 51–81.

DOI

Publication Date

January 1, 2009

Start / End Page

51 / 81