1.
Critical section problem
·
Mutual exclusion
·
Progress
·
Bounded waiting
2.
Semaphores
·
Usage
·
Implementation
·
Deadlocks and
starvation
·
Binary semaphores
3.
CLASSIC PROBLEMS OF SYNCHRONIZATION
·
BOUNDED BUFFER
·
READERS WRITERS
·
DINING
PHILOSPERS
4.
CRITICAL REGIONS
5.
MONITORS
6.
DEADLOCKS:
·
AVOIDANCE
·
RECOVERY
·
DETECTION
7.
DEALOCK
CHARACTERIZATION:
1.NECESSARY
CONDITIONS:
o MUTUAL EXCLUSION
o HOLD AND WAIT
o NO PREEMPTION
o CIRCULAR WAIT
2.
RESOURCE ALLOCATION GRAPH
8. DEADLOCK PREVENTION:
- MUTUAL
EXCLUSION
- HOLD AND
WAIT
- NO
PREEMPTION
- CIRCULAR
WAIT
9. DEADLOCK AVOIDANCE:
- SAFE STATE
- RESOURCE
ALLOCATION GRAPH
- BANKERS
10. DEADLOCK DETECTION:
- SINGLE
INSTANCES OF EACH RESOURCE TYPE
- SEVERAL
INSTANCES OF A RESOURCE TYPE
- DETECTION
ALGORITHM USAGE
11. DEADLOCK
RECOVERY:
- PROCESS
TERMINATION
- RESOURCE
PREEMPTION
No comments:
Post a Comment