Scribd Logo
Upload

Welcome to Scribd!

  • Check That Request

    Uploaded by

    Nisera
    11 views1 page
    The document describes an allocation of available resources ABC among processes P0-P4. It first checks that a sample request of (1,0,2) is less than or equal to the available resources of (3,3,2). It then lists the allocation needs and available resources for each process. Finally, it provides the safe sequence of <P1, P3, P4, P0, P2> and asks if requests of (3,3,0) by P4 and (0,2,0) by P0 can be granted given the available resources.

    Original Description:

    Original Title

    Check that Request.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an allocation of available resources ABC among processes P0-P4. It first checks that a sample request of (1,0,2) is less than or equal to the available resources of (3,3,2). It then lists the allocation needs and available resources for each process. Finally, it provides the safe sequence of <P1, P3, P4, P0, P2> and asks if requests of (3,3,0) by P4 and (0,2,0) by P0 can be granted given the available resources.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    11 views1 page

    Check That Request

    Uploaded by

    Nisera
    The document describes an allocation of available resources ABC among processes P0-P4. It first checks that a sample request of (1,0,2) is less than or equal to the available resources of (3,3,2). It then lists the allocation needs and available resources for each process. Finally, it provides the safe sequence of <P1, P3, P4, P0, P2> and asks if requests of (3,3,0) by P4 and (0,2,0) by P0 can be granted given the available resources.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

     Check that Request ≤Available (that is, (1,0,2)

    ≤(3,3,2) true
    Allocation Need Available
    ABC ABC ABC
    P0 010 743 230
    P1 302 020
    P2 302 600
    P3 211 011
    P4 002 431
     Executing safety algorithm shows that sequence <
    P1, P3, P4, P0, P2> satisfies safety requirement
     Can request for (3,3,0) by P4 be granted?
     Can request for (0,2,0) by P0 be granted?

    You might also like