"如果没有互斥，那么 volatile 如何确保发生之前的关系？"

Question

I read over here<\/a> that volatile<\/code> doesn't entail mutual exclusion locking, then how volatile ensures happens-before relationship or how volatile ensures that other thread reads updated value?

Answer 1

I'll hope to provide some insights in how a lock and volatile variable fit into the happens-before relation.

int a=0
int b=0

CPU1:
    a=1 (1)
    b=1 (2)

CPU2:
    while(b==0); (3)
    print(a) (4)

Answer 2

Volatile ensure happens-before relationship by two mechanisms:

Answer 3

Actually, on most multi-CPU architectures, it's kind of the other way around. Locking and unlocking a mutex ensures "happens-before" because a mutex treats unlock operations the same as writes to a volatile variable, and it treats lock operations the same as reads.

The real magic happens in hardware: Most modern processors have special memory barrier instructions that user-mode programs can use to ensure coherence between different CPU caches when it is important.

Forcing coherence is expensive. If the caches had to always be coherent, programs would run much more slowly. The purpose of the memory barrier instructions is to mark the parts of the program where coherence really matters, and outside of those code regions, the CPUs are free to cache data independently of each other.

Reading and writing any volatile variable causes your program to execute memory barrier instructions that force the hardware to obey the "happens before" requirements of the Java Language Spec. And, locking and unlocking any mutex also causes your program to execute the same or similar instructions.