Scribd Logo
Upload

Welcome to Scribd!

  • 2K views

    Banker's Algorithm in Operating System

    Uploaded by

    Abhay Dubey-03
    1) The need matrix is created by subtracting the allocation from the maximum for each process. 2) By applying the Banker's Algorithm, the system is determined to be in a safe state, with the safe sequence being P2, P4, P5, P1, and P3. 3) The resource request (1, 0, 0) by P1 can be immediately granted since it is less than the available resources.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Banker's Algorithm in Operating System

    Uploaded by

    Abhay Dubey-03
    2K views4 pages
    1) The need matrix is created by subtracting the allocation from the maximum for each process. 2) By applying the Banker's Algorithm, the system is determined to be in a safe state, with the safe sequence being P2, P4, P5, P1, and P3. 3) The resource request (1, 0, 0) by P1 can be immediately granted since it is less than the available resources.

    Original Description:

    Original Title

    Banker's Algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1) The need matrix is created by subtracting the allocation from the maximum for each process. 2) By applying the Banker's Algorithm, the system is determined to be in a safe state, with the safe sequence being P2, P4, P5, P1, and P3. 3) The resource request (1, 0, 0) by P1 can be immediately granted since it is less than the available resources.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    2K views4 pages

    Banker's Algorithm in Operating System

    Uploaded by

    Abhay Dubey-03
    1) The need matrix is created by subtracting the allocation from the maximum for each process. 2) By applying the Banker's Algorithm, the system is determined to be in a safe state, with the safe sequence being P2, P4, P5, P1, and P3. 3) The resource request (1, 0, 0) by P1 can be immediately granted since it is less than the available resources.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    Banker's Algorithm in Operating System

    Example: Consider a system that contains five processes P1, P2, P3, P4, P5 and
    the three resource types A, B and C. Following are the resources types: A has 10, B
    has 5 and the resource type C has 7 instances.

    Process Allocation Max Available


    A B C A B C A B C

    P1 0 1 0 7 5 3 3 3 2

    P2 2 0 0 3 2 2

    P3 3 0 2 9 0 2

    P4 2 1 1 2 2 2

    P5 0 0 2 4 3 3

    Answer the following questions using the banker's algorithm:

    1. What is the reference of the need matrix?


    2. Determine if the system is safe or not.
    3. What will happen if the resource request (1, 0, 0) for process P1 can the
    system accept this request immediately?

    Ans. 2: Context of the need matrix is as follows:

    Need [i] = Max [i] - Allocation [i]


    Need for P1: (7, 5, 3) - (0, 1, 0) = 7, 4, 3
    Need for P2: (3, 2, 2) - (2, 0, 0) = 1, 2, 2
    Need for P3: (9, 0, 2) - (3, 0, 2) = 6, 0, 0
    Need for P4: (2, 2, 2) - (2, 1, 1) = 0, 1, 1
    Need for P5: (4, 3, 3) - (0, 0, 2) = 4, 3, 1
    Process Need
    A B C

    P1 7 4 3

    P2 1 2 2

    P3 6 0 0

    P4 0 1 1

    P5 4 3 1

    Hence, we created the context of need matrix.

    Ans. 2: Apply the Banker's Algorithm:

    Available Resources of A, B and C are 3, 3, and 2.

    Now we check if each type of resource request is available for each process.

    Step 1: For Process P1:

    Need <= Available

    7, 4, 3 <= 3, 3, 2 condition is false.

    So, we examine another process, P2.

    Step 2: For Process P2:

    Need <= Available

    1, 2, 2 <= 3, 3, 2 condition true

    New available = available + Allocation

    (3, 3, 2) + (2, 0, 0) => 5, 3, 2

    Similarly, we examine another process P3.

    Step 3: For Process P3:


    P3 Need <= Available

    6, 0, 0 < = 5, 3, 2 condition is false.

    Similarly, we examine another process, P4.

    Step 4: For Process P4:

    P4 Need <= Available

    0, 1, 1 <= 5, 3, 2 condition is true

    New Available resource = Available + Allocation

    5, 3, 2 + 2, 1, 1 => 7, 4, 3

    Similarly, we examine another process P5.

    Step 5: For Process P5:

    P5 Need <= Available

    4, 3, 1 <= 7, 4, 3 condition is true

    New available resource = Available + Allocation

    7, 4, 3 + 0, 0, 2 => 7, 4, 5

    Now, we again examine each type of resource request for processes P1 and P3.

    Step 6: For Process P1:

    P1 Need <= Available

    7, 4, 3 <= 7, 4, 5 condition is true

    New Available Resource = Available + Allocation

    7, 4, 5 + 0, 1, 0 => 7, 5, 5

    So, we examine another process P2.


    Step 7: For Process P3:

    P3 Need <= Available

    6, 0, 0 <= 7, 5, 5 condition is true

    New Available Resource = Available + Allocation

    7, 5, 5 + 3, 0, 2 => 10, 5, 7

    Hence, we execute the banker's algorithm to find the safe state and the safe
    sequence like P2, P4, P5, P1 and P3.

    Ans. 3: For granting the Request (1, 0, 2), first we have to check that Request <=
    Available, that is (1, 0, 2) <= (3, 3, 2), since the condition is true. So the process
    P1 gets the request immediately.

    You might also like