Concurrency 0/73

Concurrency

Atomics and memory ordering

Atomic operations, the C++ memory orders and the happens-before relation that decides what one thread can see of another thread’s writes. A single-producer single-consumer queue is correct only if its orderings are.

0 / 1 problems solved 0 / 19 questions solved

Questions

0/19 solved
Question Tags Difficulty Success
1. Atomic vs Mutex
Concurrency
Medium 33%
2. Atomic Operation Limitations
atomic_operationsfetch_add +3
Medium 67%
3. Weakest order
Concurrency
Medium 91%
4. One Shot Swap
Concurrency
Medium 49%
5. Atomic flag spin lock
Concurrency
Medium 64%
6. Sequential Consistency
seq_cstmemory_ordering +2
Medium 57%
7. Flag Without A Fence
memory-orderingacquire-release +2
Medium 90%
8. std::atomic Compare-Exchange
ConcurrencyData Structures
Hard 58%
9. Synchronizing Relationship
happens_beforesynchronizes_with +3
Hard 76%
10. Both Read Zero
memory-orderingstore-buffer +2
Hard 91%
11. Failure Order Derived
compare-exchangememory-ordering +2
Hard 44%
12. What Acquire Does Not Do
acquire-releasememory-barriers +2
Hard 26%
13. Memory Order Acquire-Release
ConcurrencyMemory Management
Hard 67%
14. Nothing Orders Memory
memory-orderrelaxed +2
Hard 81%
15. Fence Pairs With Fence
memory-fencerelease-acquire +2
Hard 64%
16. Atomic Is Not Ordered
memory-order-relaxedrelease-acquire +2
Hard 100%
17. Half Built Singleton
double-checked-lockingpublication +2
Hard 67%
18. std::atomic Memory Order Relaxed
ConcurrencyMemory Management
Insane 47%
19. Two Readers Disagree
iriwseq-cst +2
Insane 71%