BiteSizedChunks.comLearn one small thing at a time.

Courses Suggested Paths Pricing

Course contentsShowHide

Operating Systems

295The critical-section problem requirements
296Disabling interrupts
297Peterson's algorithm
298Dekker's algorithm
299Lamport's bakery algorithm
300Test-and-set instruction
301Compare-and-swap
302Load-linked and store-conditional
303Fetch-and-add
304Atomic exchange
305Memory barriers and fences
306Acquire and release semantics
307Sequential consistency
308x86 total store ordering
309ARM weak memory model
310The C11 memory model
311The Linux kernel memory model
312Cache coherence and MESI
313False sharing
314Cache-line bouncing
315Spinlocks
316Test-and-test-and-set spinlock
317Ticket locks
318MCS locks
319CLH locks
320qspinlock in Linux
321Backoff strategies for spinlocks
322Spin versus sleep tradeoff
323Adaptive mutexes
324Futexes in depth
325Mutex lock and unlock
326Recursive mutexes
327Error-checking mutexes
328Robust mutexes
329Timed locks
330Trylock
331Counting semaphores
332Binary semaphores
333POSIX named semaphores
334System V semaphores
335Semaphore implementation with queues
336Condition variables wait and signal
337Spurious wakeups
338Broadcast versus signal
339Monitors with Mesa semantics
340Monitors with Hoare semantics
341Readers-writer locks
342Writer starvation in rwlocks
343Sequence locks
344Barriers
345Pthread barriers
346Latches and countdown latches
347Events on Windows
348Critical sections on Windows
349Slim reader-writer locks
350Windows mutants and semaphores
351WaitForMultipleObjects
352Linux kernel mutexes
353Linux kernel semaphores
354Completions in Linux
355Wait queues
356Lock ordering and lockdep
357Reentrant locking pitfalls
358Lock granularity: coarse versus fine
359Lock convoys
360Lock elision and hardware transactional memory
361The ABA problem
362Lock-free stacks
363Michael-Scott queue
364Lock-free linked lists
365Hazard pointers
366Epoch-based reclamation
367Read-copy-update
368RCU grace periods
369Per-CPU variables
370Seqlock versus RCU
371Wait-free algorithms
372Software transactional memory
373Atomic reference counting
374Double-checked locking
375The memory-model bug in double-checked locking
376Flat combining
377Concurrent hash tables
378Ring buffers and SPSC queues
379LMAX disruptor pattern
380Actor model
381Communicating sequential processes
382Message passing synchronization
383Async/await versus threads
384Concurrency bug taxonomy
385Data race detection with ThreadSanitizer
386Helgrind and DRD
387Deadlock detection tools
388Model checking concurrent code
389Bounded buffer with semaphores
390Readers-writers: first problem
391Readers-writers: second problem
392Dining philosophers with resource ordering
393Dining philosophers with an arbitrator
394Chandy-Misra solution
395Sleeping barber problem
396Cigarette smokers problem
397Santa Claus problem
398Unisex bathroom problem
399Roller coaster problem
400Savages and the cooking pot
401H2O building problem
402The Little Book of Semaphores patterns
403Rendezvous pattern
404Turnstile pattern
405Producer-consumer with condition variables

Operating Systems

295The critical-section problem requirements
296Disabling interrupts
297Peterson's algorithm
298Dekker's algorithm
299Lamport's bakery algorithm
300Test-and-set instruction
301Compare-and-swap
302Load-linked and store-conditional
303Fetch-and-add
304Atomic exchange
305Memory barriers and fences
306Acquire and release semantics
307Sequential consistency
308x86 total store ordering
309ARM weak memory model
310The C11 memory model
311The Linux kernel memory model
312Cache coherence and MESI
313False sharing
314Cache-line bouncing
315Spinlocks
316Test-and-test-and-set spinlock
317Ticket locks
318MCS locks
319CLH locks
320qspinlock in Linux
321Backoff strategies for spinlocks
322Spin versus sleep tradeoff
323Adaptive mutexes
324Futexes in depth
325Mutex lock and unlock
326Recursive mutexes
327Error-checking mutexes
328Robust mutexes
329Timed locks
330Trylock
331Counting semaphores
332Binary semaphores
333POSIX named semaphores
334System V semaphores
335Semaphore implementation with queues
336Condition variables wait and signal
337Spurious wakeups
338Broadcast versus signal
339Monitors with Mesa semantics
340Monitors with Hoare semantics
341Readers-writer locks
342Writer starvation in rwlocks
343Sequence locks
344Barriers
345Pthread barriers
346Latches and countdown latches
347Events on Windows
348Critical sections on Windows
349Slim reader-writer locks
350Windows mutants and semaphores
351WaitForMultipleObjects
352Linux kernel mutexes
353Linux kernel semaphores
354Completions in Linux
355Wait queues
356Lock ordering and lockdep
357Reentrant locking pitfalls
358Lock granularity: coarse versus fine
359Lock convoys
360Lock elision and hardware transactional memory
361The ABA problem
362Lock-free stacks
363Michael-Scott queue
364Lock-free linked lists
365Hazard pointers
366Epoch-based reclamation
367Read-copy-update
368RCU grace periods
369Per-CPU variables
370Seqlock versus RCU
371Wait-free algorithms
372Software transactional memory
373Atomic reference counting
374Double-checked locking
375The memory-model bug in double-checked locking
376Flat combining
377Concurrent hash tables
378Ring buffers and SPSC queues
379LMAX disruptor pattern
380Actor model
381Communicating sequential processes
382Message passing synchronization
383Async/await versus threads
384Concurrency bug taxonomy
385Data race detection with ThreadSanitizer
386Helgrind and DRD
387Deadlock detection tools
388Model checking concurrent code
389Bounded buffer with semaphores
390Readers-writers: first problem
391Readers-writers: second problem
392Dining philosophers with resource ordering
393Dining philosophers with an arbitrator
394Chandy-Misra solution
395Sleeping barber problem
396Cigarette smokers problem
397Santa Claus problem
398Unisex bathroom problem
399Roller coaster problem
400Savages and the cooking pot
401H2O building problem
402The Little Book of Semaphores patterns
403Rendezvous pattern
404Turnstile pattern
405Producer-consumer with condition variables

← Operating Systems

Search the Operating Systems glossary

Lesson 365 of 2,075·10. Synchronization PrimitivesFree lesson

Hazard pointers

Writing your lesson…

← Previous Next lesson →

© 2026 BiteSizedChunks.com. Learn one small thing at a time.

Glossary Contact Terms of Service Privacy Policy