PPT Slide
Six approaches to the deadlock problem (from extreme to liberal)
- Never grant resource requests!
- Serialize process executions (one process at a time only)!
- One-shot allocation - a process must request all it’s resources at once.
- Hierarchical allocation - a process must request resources in a known order.
- Advance claim - a process must indicate it’s maximum requests at one time (needed for deadlock avoidance algorithm, such as the Banker’s algorithm).
- Always allocate & hope detect/recover works!