ExpertMultiple choice
A producer writes data then sets a flag; a consumer reads the flag then the data. What is the weakest memory ordering that suffices?
- ARelease on the store to the flag, acquire on the load
- BRelaxed on both, since the flag is atomic
- CSequential consistency on both, since nothing weaker is safe
- DA mutex, since atomics cannot order other memory
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Learn the method
Reported in interviews at
More systems and low latency questions
- A ring buffer has capacity 1024 and wraps its index with a bit mask instead of a modulo.Foundation
- Per-thread counters, part 1 of 3Foundation
- Five per cent of a workload is inherently serial.Applied
- A system handles 10⁶ messages a second with an average time in system of 5 μs.Applied
- Thread 1 locks A then B; thread 2 locks B then A.Applied
- Messages arrive at 400,000 a second and take 2 μs each to process on one thread.Advanced