Scribd Logo
Upload

Welcome to Scribd!

  • Untitled

    Uploaded by

    dwi purnomo
    7 views2 pages
    The document shows a resource allocation table for 5 processes (p0-p4) requesting 3 resources (a, b, c). It tracks the current allocation of each resource to each process, the maximum need of each process, the available amount of each resource, and the remaining need of each process. The table indicates that allocating resources in the order of processes p1, p3, p4, p0, p2 would not result in a deadlock.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document shows a resource allocation table for 5 processes (p0-p4) requesting 3 resources (a, b, c). It tracks the current allocation of each resource to each process, the maximum need of each process, the available amount of each resource, and the remaining need of each process. The table indicates that allocating resources in the order of processes p1, p3, p4, p0, p2 would not result in a deadlock.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views2 pages

    Untitled

    Uploaded by

    dwi purnomo
    The document shows a resource allocation table for 5 processes (p0-p4) requesting 3 resources (a, b, c). It tracks the current allocation of each resource to each process, the maximum need of each process, the available amount of each resource, and the remaining need of each process. The table indicates that allocating resources in the order of processes p1, p3, p4, p0, p2 would not result in a deadlock.

    Copyright:

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

    alokasi max available need

    proses a b c a b c a b c a b c
    p0 0 1 0 7 5 3 3 3 2 7 4 3
    p1 2 0 0 3 2 2 5 3 2 1 2 2
    p2 3 0 2 9 0 2 7 4 3 6 0 0
    p3 2 1 1 2 2 2 7 4 5 0 1 1
    p4 0 0 2 4 3 3 7 5 5 4 3 1
    free 10 5 7 10 5 7

    tidak menimbulkan deadlock


    urutan proses p1 p3 p4 p0 p2

    alokasi max available need


    proses a b c a b c a b c a b c
    p0 0 1 0 7 5 3 2 3 0 7 4 3
    p1 3 0 2 3 2 2 5 3 2 0 2 0
    p2 3 0 2 9 0 2 7 4 3 6 0 0
    p3 2 1 1 2 2 2 7 4 5 0 1 1
    p4 0 0 2 4 3 3 7 5 5 4 3 1
    free 10 5 7 10 5 7
    tidak deadlock
    urutan Proses p1 p3 p4 p0 p2
    p1 102 p1 <=need
    p4 330 p4<=available
    need kurang dari available

    You might also like