Threads in the new ISO C Standard from 2011

More documents

Recommendations

Info

Memory Fences These are also called memory barriers and are used frequently in the Linux kernel. A memory fence is one of: release fence acquire fence both release and acquire fence A fence has no memory location operand. Two threads T1 and T2 synchronize using a fence if T1 writes to an atomic object M after the release fence which is read by T2 before the acquire fence. Details on the following slides. Jonas Skeppstedt (js@cs.lth.se) Lecture 6 2013 28 / 70
An Example _Atomic int m; int u; // Thread 1 Thread 2 u = 1; atomic_thread_fence(memory_order_release); // A atomic_store_explicit(&m, 1, memory_order_relaxed); // X atomic_load_explicit(&m, memory_order_relaxed); // Y atomic_thread_fence(memory_order_acquire); // B printf("u = %d\n", u); Accesses to atomic objects do not produce data races. Simply running the two threads does not order them in any way. Only if Thread 2 reads m after the write then it knows that the value of u is correct. The modification of u happens before the read of u. Jonas Skeppstedt (js@cs.lth.se) Lecture 6 2013 29 / 70
Page 1 and 2: Threads in the new ISO C Standard f
Page 3 and 4: Atomic Objects Atomic objects are n
Page 5 and 6: Using Atomic Objects Members of an
Page 7 and 8: Lock Free Property To know whether
Page 9 and 10: Memory Order for Atomic Operations
Page 11 and 12: Answer: Yes The code may execute in
Page 13 and 14: Atomic Compare and Exchange There a
Page 15 and 16: Weak Compare and Exchange Functions
Page 17 and 18: Atomic Fetch and Modify Functions T
Page 19 and 20: Atomic Flag The atomic flag type an
Page 21 and 22: The C11 Memory Consistency Model fo
Page 23 and 24: Release and Acquire, and Consume Re
Page 25 and 26: Happens Before and Data Races We wi
Page 27: Sequenced Before The most common se
Page 31 and 32: Dependences Dependences are intra-t
Page 33 and 34: Definition of Dependency in C11 A c
Page 35 and 36: Inter-Thread Happens Before An eval
Page 37 and 38: Read-Copy Update RCU is an alternat
Page 39 and 40: A Simplified Example Consider the f
Page 41 and 42: More Details About Dependences Reca
Page 43 and 44: Constant Propagation Example 2(3) T
Page 45 and 46: One More Data Dependency a = atomic
Page 47 and 48: Load and Reserve/Store Conditional
Page 49 and 50: Power Memory Barrier Instructions T
Page 51 and 52: lwsync Memory Barrier for Release O
Page 53 and 54: c;isync Memory Barrier for Load Acq
Page 55 and 56: Cumulative Ordering If the memory a
Page 57 and 58: Implementation on Power The followi
Page 59 and 60: Store Store relaxed st Store releas
Page 61 and 62: Acquire and Release a Spin Lock # a
Page 63 and 64: Initialization Function void call_o
Page 65 and 66: Mutex Options for mtx_init Function
Page 67 and 68: Condition Variable Functions int cn
Page 69 and 70: Thread Functions int thrd_create(th

Threads in the new ISO C Standard from 2011

Create successful ePaper yourself

Delete template?

Save as template?