Deadlock Handling
Conditions and strategies for dealing with deadlocks.
The data
0
- Concept
- Mutual Exclusion
- Description
- At least one resource must be non-sharable.
1
- Concept
- Hold and Wait
- Description
- A process holds resources while waiting for additional ones.
2
- Concept
- No Preemption
- Description
- Resources cannot be forcibly taken from a process.
3
- Concept
- Circular Wait
- Description
- A circular chain of processes each waiting for a resource held by the next.
4
- Concept
- Banker's Algorithm
- Description
- Deadlock avoidance using safety checks on resource allocation.
5
- Concept
- Deadlock Prevention
- Description
- Design the system so at least one necessary condition cannot hold.
6
- Concept
- Deadlock Detection
- Description
- Periodically check the resource allocation graph for cycles.
Fetch the same bytes
The static files are identical to what the API returns, but with no rate limit and no server round trip. Use the API when you want a query and a content type; use the files when you want to cache one document.
curl "https://yjtoon.com/api/dataset/deadlock-handling?format=toon"
const res = await fetch( "https://yjtoon.com/static-data/dataset/deadlock-handling.toon" ); const toon = await res.text();
Rate limit: 120 requests per minute per IP, no key and no signup. API reference →