Week 9, Class 3:Java’s Happens-Before Memory Model (Slides used and skipped in class)

SE-2811Slide design: Dr. Mark L. Hornick

Content: Dr. HornickErrors: Dr. Yoder

1

Surprising Fact: Compiler can re-order instructions

When compiled, A = B+1; B = 1;May be executed as tmp = B; B = 1; tmp++; A = tmp;Source: Preshing (see notes for this slide)SE-2811

Dr.Yoder 2

Why is this OK? A = B+1; B = 1;

tmp = B;A = tmp + 1;B = 1;

SE-2811Dr.Yoder 3

SAME

Why is this OK? A = B+1; B = 1;

tmp = B;tmp++;A = tmp;B = 1;

SE-2811Dr.Yoder 4

SAME

Why is this OK? A = B+1; B = 1;

tmp = B;tmp++;A = tmp;B = 1;

SE-2811Dr.Yoder 5

SAMEtmp = B;B = 1; tmp++;A = tmp;

SAME

Why does the compiler do this?

Machine instructions are like this.tmp = B;

tmp++;A = tmp;B = 1;

Exercise: What machine instructions are these?6

Why does the compiler do this?

We can read and write faster to “tmp”tmp = B;B = 1;tmp++;A = tmp;

Exercise: What is tmp? Why can we read and write faster to it?

SE-2811Dr.Yoder 7

Result: Seemingly impossible things can happenA = 0;…r1 = A;B = 2;

B = 0;…r2 = B;A = 1;

SE-2811Dr.Yoder 8

Exercise: How could we get r1 = 1 and r2 = 0?Java Lang. Spec Example 17.4-1.

It is possible for both r1 = 1 and r2 = 2!A = 0;…r1 = A;B = 2;

B = 0;…A = 1;r2 = B;

SE-2811Dr.Yoder 9

Exercise: How could we get r1 = 1 and r2 = 2?(Would this be possible without reordering?)Java Lang. Spec Example 17.4-1.

How to ensure multithreaded applications work as expected? Avoid problems due to

reordering caching (as seen yesterday)

While still being fast!

SE-2811Dr. Yoder 10

We need a “Memory Model”

“The Java programming language memory model works by examining each read in an execution trace and checking that the write observed by that read is valid according to certain rules.”http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4

SE-2811Dr.Yoder 11

Shared VariablesShared instance fields static fields array elements

Never shared local variables method parameters exception parameters e.g. catch(Exception e)

SE-2811Dr.Yoder 12

http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4.1

Happens-Before

“If one action happens-before another, then the first is visible to and ordered before the second.”

http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4.1 SE-2811

Dr. Yoder 13

Important caveat:

“An implementation is free to produce any code it likes, as long as all resulting executions of a program produce a result that can be predicted by the memory model.”

http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4

SE-2811Dr.Yoder 14

Some happens-before relationships “Each action in a thread happens-

before every action in that thread that comes later in the program's order.

“An unlock (synchronized block or method exit) of a monitor happens-before every subsequent lock (synchronized block or method entry) of that same monitor.

“A write to a volatile field happens-before every subsequent read of that same field. SE-2811

Dr. Yoder 15

Some happens-before relationships “A call to start on a thread happens-

before any action in the started thread. “All actions in a thread happen-before any

other thread successfully returns from a join on that thread.”

http://docs.oracle.com/javase/8/docs/api/java/util/concurrent/package-summary.html#MemoryVisibility

SE-2811Dr.Yoder 16

“Happens-Before Does Not Imply Happening Before”

“It should be noted that the presence of a happens-before relationship between two actions does not necessarily imply that they have to take place in that order in an implementation. If the reordering produces results consistent with a legal execution, it is not illegal.”

http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4.5

SE-2811Dr.Yoder 17

“Happening Before Does Not Imply Happens-Before”

“More specifically, if two actions share a happens-before relationship, they do not necessarily have to appear to have happened in that order to any code with which they do not share a happens-before relationship. Writes in one thread that are in a data race with reads in another thread may, for example, appear to occur out of order to those reads.”

http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4.5

SE-2811Dr.Yoder 18

“Happening Before Does Not Imply Happens-Before”

void publishMessage() { answer = 42; // (1) isReady = true; // (2)}

void consumeMessage() { if (isReady) // (3) sout(answer); // (4)}http://preshing.com/20130702/the-happens-before-relation/

http://preshing.com/20130702/the-happens-before-relation/

SE-2811Dr.Yoder 19

“Happening Before Does Not Imply Happens-Before”void publishMessage() { answer = 42; isReady = 1; }

void consumeMessage() { if (isReady) sout("%d\n", answer);}http://preshing.com/20130702/the-happens-before-relation/

Exercise: How might this code execute to print 0 instead of 42?

(You may use reordering and/or caching in your solution)

SE-2811Dr.Yoder 20

Happens-Before

“If one action happens-before another, then the first is visible to and ordered before the second.”

http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4.1 SE-2811

Dr. Yoder 21

Important caveat:

“An implementation is free to produce any code it likes, as long as all resulting executions of a program produce a result that can be predicted by the memory model.”

http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4

SE-2811Dr.Yoder 22

“Happening Before Does Not Imply Happens-Before”void publishMessage() { answer = 42; isReady = 1; }

void consumeMessage() { if (isReady) printf("%d\n", answer);}http://preshing.com/20130702/the-happens-before-relation/

http://preshing.com/20130702/the-happens-before-relation/

Exercise: How might this code execute to print 0 instead of 42?

(You may use reordering and/or caching in your solution)

SE-2811Dr.Yoder 23

Some happens-before relationships “Each action in a thread happens-

before every action in that thread that comes later in the program's order.

“An unlock (synchronized block or method exit) of a monitor happens-before every subsequent lock (synchronized block or method entry) of that same monitor.

“A write to a volatile field happens-before every subsequent read of that same field. SE-2811

Dr. Yoder 24

Some happens-before relationships “A call to start on a thread happens-

before any action in the started thread. “All actions in a thread happen-before any

other thread successfully returns from a join on that thread.”

http://docs.oracle.com/javase/8/docs/api/java/util/concurrent/package-summary.html#MemoryVisibility

SE-2811Dr.Yoder 25

Some definitions

“Two accesses to (reads of or writes to) the same variable are said to be conflicting if at least one of the accesses is a write.” (§17.4.1)

“When a program contains two conflicting accesses that are not ordered by a happens-before relationship, it is said to contain a data race.” (§17.4.5)

SE-2811Dr.Yoder 26

What is a “Memory Model”?

“A memory model describes, given a program and an execution trace of that program, whether the execution trace is a legal execution of the program.”http://docs.oracle.com/javase/specs/jls/se7/html/jls-17.html#jls-17.4

SE-2811Dr.Yoder 27

Total and Partial OrderPartial Order One Total Order

SE-2811Dr.Yoder 28

Total and Partial OrderPartial Order One Total Order

SE-2811Dr.Yoder 29

Total and Partial OrderPartial Order Another Total Order

SE-2811Dr.Yoder 30

Total and Partial OrderEach thread has a Total

Order

SE-2811Dr.Yoder 31

My conclusion If a program has no data races, then we can

treat that program as if it behaved according to our simple “switch-back-and-forth-between-threads” model which we used to illustrate multithreading at the beginning of the class.

SE-2811Dr.Yoder 32

Caveat

“Sequential consistency and/or freedom from data races still allows errors arising from groups of operations that need to be perceived atomically and are not.” (§17.4.3)

SE-2811Dr.Yoder 33

A set of operations that happen all at once; they cannot be interrupted

if(theInstance == null) { theInstance = new MySingleton();}

Atomic

SE-2811Dr.Yoder 34

Example: Should be atomic

The double-locked Singleton

if(theInstance == null) { synchronized(MySingleton.class) { if(theInstance == null){ theInstance = new MySingleton(); } }}return theInstance;

SE-2811Slide design: Dr. Mark L. Hornick

Content: Dr. HornickErrors: Dr. Yoder

35

The faster double-locked SingletonMySingleton local = theInstance;if(local == null) { synchronized(MySingleton.class) { local = theInstance; if(local == null) { local = theInstance = new MySingleton(); } }}return local; SE-2811

Slide design: Dr. Mark L. HornickContent: Dr. Hornick

Errors: Dr. Yoder

36

DO VARIABLES STORE OBJECTS?

You may be wondering…

SE-2811Dr.Yoder 37

Volatile caveat “A write to a volatile field happens-

before every subsequent read of that same field.”

A field is an instance variable or a static variable

A variable stores either a primitive type or a reference type

A variable does not store an object.

SE-2811Dr. Yoder 38

What does this mean? Although writes to references are protected

by volatile, writes to objects are not. If you want a volatile object, you have to declare

all its fields volatile (not recommended) Even then…

You can’t do this for objects in the standard library Your class may still have parts that need to be atomic

but are not If you are calling a method that is not

designed to be used without synchronization, you should synchronize around it.SE-2811

Dr.Yoder 39

Exercise: Determine if this implementation of the double-locked Singleton is correct. Explain.if(loggers.get(path)==null){ synchronized (loggers){ if(loggers.get(path) == null){ EventLogger n = new EventLogger(path); } }}

SE-2811Dr.Yoder 40

ExerciseLoggers is a map.

If this map is not designed to be used from multiple threads, and we run this program, it isn’t safe. Explain what might go wrong.

if(loggers.get(path)==null){ synchronized (loggers){ if(loggers.get(path) == null){ EventLogger n = new EventLogger(path); } }}

SE-2811Dr.Yoder 41

An alternative: java.util.concurrentLock-free multi-threaded data structures: ConcurrentHashMap

Like HashMap, only “concurrent” ConcurrentSkipListMap

Like TreeMap, only “concurrent” Discussed in Dean & Dean

SE1011 book recommended by a student for studying data

structures

SE-2811Dr. Yoder 42

The rigormeter is at 2 today

https://www.rose-hulman.edu/~bryan/images/rigor.htmlSE-2811Dr.Yoder 43

Ex.

public void a() { System.out.println(“x”); System.out.println(“y”);

}

public void b() { System.out.println(“x”); System.out.println(“y”);

}

SE-2811Dr.Yoder 44

Prove the following code is(n’t) free of data races:

Ex.

public void a() { x = 5; System.out.println(“x”);

}

public void a() { x = 5; System.out.println(“x”);

}

SE-2811Dr.Yoder 45

Prove the following code is(n’t) free of data races:

Ex.

public void a() { synchronized { x = 5; System.out.println(“x”); }}

SE-2811Dr.Yoder 46

Prove the following code is(n’t) free of data races:

Ex.

if(theLogger==null){ synchronized (EventLogger.class){ if(theLogger == null){ theLogger = new EventLogger(path); } }}

SE-2811Dr.Yoder 47

Write whether this code contains any data races. Explain your answer. Assume loggers is not volatile.

Ex.

if(theLogger==null){ synchronized (EventLogger.class){ if(theLogger == null){ theLogger = new EventLogger(path); } }}

SE-2811Dr.Yoder 48

Write whether this code contains any data races. Explain your answer. Assume loggers is volatile.

Ex.

if(loggers.get(path)==null){ synchronized (loggers){ if(loggers.get(path) == null){ Logger logger = new EventLogger(path); loggers.put(path, logger); } }}

SE-2811Dr.Yoder 49

Write whether this code contains any data races. Explain your answer. Assume loggers is not thread safe.

Ex.

if(loggers.get(path)==null){ synchronized (loggers){ if(loggers.get(path) == null){ Logger logger = new EventLogger(path); loggers.put(path, logger); } }}

SE-2811Dr.Yoder 50

Write whether this code contains any data races. Explain your answer. Assume loggers is thread safe.