First page Back Continue Last page Overview Graphics
Data Consistency
Some kernel data structures will be accessed from more than one thread at a time
- Will become corrupted unless access is synchronized
- “Race Conditions”
Low level primitives are usually mapped into higher level programming services
- From atomic operations and IPIs
- To mutexes, semaphores, signals, locks, ...
- Lockless queues and other lockless structures
Choice of model is very important
- Affects performance and complexity