Memory Model

1 Preliminary

• Computer Architecture A Quantitative Approach, 5th Edition()

2 Memory Model

2.1 Three Aspects

Atomicity

Visibility

Ordering

2.2 General Model(Weaker)

1. The hardware threads can each perform reads and writes out-of-order, oreven speculatively (before preceding conditional branches have been resolved). In contrast to TSO, where there is no local reordering except of reads after writes to different addresses, here any local reordering is allowed unless specified otherwise.
2. The memory system (perhaps involving a hierarchy of buffers and a complex interconnect) does not guarantee that a write becomes visible to all other hardware threads at the same time point; these architectures are not multiple-copy atomic.
   

3 Two aspects

3.1 CPU Memory Model

3.1.1 Implementation

• Memory Barriers: a Hardware View for Software Hackers
  

3.1.2 Specification

3.1.3 Formal Model

• Weak vs. Strong Memory Models
  
• A Tutorial Introduction to the ARM and POWER Relaxed Memory Models
• 
  

3.2 Language Memory Model

3.2.1 Implementation

• The JSR-133 Cookbook for Compiler Writers

3.2.2 Some Concepts

• The Happens-Before Relation
• The Synchronizes-With Relation
  
• Acquire and Release Semantics
• Acquire and Release Fences
  

3.2.3 Language Standard

Java: Java Language Specification Chapter 17. Threads and Locks

C++: ISO/IEC 14882:2011(E) Information technology ¡ª Programming languages ¡ª C++ [1.10, 29]

3.2.4 Nonformal Interpretation

3.2.4.1 Java

• The JMM Cookbook for Java Developers
• The Java Memory Model
• JSR 133 (Java Memory Model) FAQ
• Java theory and practice: Fixing the Java Memory Model, Part 1
• Java theory and practice: Fixing the Java Memory Model, Part 2
  

3.2.4.2 C++

• N2480: A Less Formal Explanation of the Proposed C++ Concurrency Memory Model
• Synchronization riddle with std::memory_order and three threads
  

4 Applications(Concurrent/Parallel Programming)

4.1 Lock-Free Programming

• An Introduction to Lock-Free Programming
• Lockless Programming Considerations for Xbox 360 and Microsoft Windows

4.1.1 Examples

• A Lock-Free... Linear Search?
• The World's Simplest Lock-Free Hash Table
  

4.1.2 Libraries

• Mintomic: A Small, Portable Lock-Free API

4.2 Books

• Is Parallel Programming Hard, And, If So, What Can You Do About It?
• C++ Concurrency in Action
• The Art of Multiprocessor Programming

5 Others

5.1 Nice Blogs

• Preshing on programming
  

5.2 Mixed

• CPU Cache and Memory Ordering(Ð޸İæ)