Lock-free and wait-free algorithms
Lock-free and wait-free algorithms have got the special property that they should guarantee that every active process will make progress within a limited number of steps. Their assurances make them interesting for multithreaded programming.
See also
- Deadlock
- Real-time
- Starvation
- Contention
- Synchronization
- Mutual exclusion
- Priority inversion
- Concurrency control
- Control flow analysis
- Pre-emptive multitasking
- Non-blocking synchronization