Please enable JavaScript.

Coggle requires JavaScript to display documents.

DEADLOCK, METHODS FOR HANDLING DEADLOCK, BANKER's ALGORITHM, n =>…

- - - - Banker's Algorithm
      - RAG(Resource Allocation Graph)
      - Wait for Graph
- - - - Allocate all the required resources to the process at the very beginning this will eliminate the hold and wait condition but will lead to poor performance
    - - Preempt resources from the process when required by high priority processes.
    - - NOT POSSIBLE
        
        Printers and tape drivers are inherently not shareable
        SPOOL(Simultaneous Peripheral Operations Online) technique is used with printers.
    - - The resources are assigned with a numerical number. The process can request either in increasing or decreasing order of numbering, this will prevent the circular wait
        
        suppose process P is holding R3 process and now request for R1 process, so it will not be granted it can only request for higher numbered processes.