Concurrency 0/73

Concurrency

Lock-free queues and stacks

Compare-and-swap loops, the ABA problem and safe memory reclamation in multi-producer queues and stacks. These are the hardest problems in the catalog and a staple of low-latency trading interviews.

0 / 4 problems solved 0 / 13 questions solved

Questions

0/13 solved
Question Tags Difficulty Success
1. Thread Pool Design
thread_poolcondition_variable +2
Medium 70%
2. CAS Loop Pattern
caslock_free +1
Medium 88%
3. Work Stealing
work_stealingthread_pool +2
Medium 100%
4. Lock-Free vs Wait-Free
lock_freewait_free +1
Medium 88%
5. Exception Safety in Parallel Algorithms
exception_safetyparallel +2
Medium 85%
6. Lock Free Is Not Fast
lock-freewait-free +2
Medium 100%
7. ABA Problem
aba_problemcas +2
Hard 94%
8. Hazard Pointers
hazard_pointersmemory_reclamation +2
Hard 89%
9. Split Reference Counting
reference_countingmemory_reclamation +2
Hard 48%
10. The Stale Next Pointer
treiber-stackcompare-exchange +2
Hard 60%
11. Read-Copy-Update (RCU)
ConcurrencyMemory Management +1
Hard 88%
12. A Then B Then A
aba-problemtagged-pointer +2
Hard 100%
13. Correct CAS Still Crashes
memory-reclamationhazard-pointers +2
Hard 80%