Scribd Logo
Upload

Welcome to Scribd!

  • Me Mal Location

    Uploaded by

    Bing Bong
    17 views6 pages
    The document describes memory allocation in an operating system using partitions of different sizes. It compares three allocation strategies: worst-fit, first-fit, and best-fit. For each strategy, it shows how six processes of varying sizes would be allocated to partitions. Worst-fit allocates processes to the partition with the largest remaining space, first-fit to the first partition that fits, and best-fit to the partition that fits with the least remaining space.

    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 describes memory allocation in an operating system using partitions of different sizes. It compares three allocation strategies: worst-fit, first-fit, and best-fit. For each strategy, it shows how six processes of varying sizes would be allocated to partitions. Worst-fit allocates processes to the partition with the largest remaining space, first-fit to the first partition that fits, and best-fit to the partition that fits with the least remaining space.

    Copyright:

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

    Me Mal Location

    Uploaded by

    Bing Bong
    The document describes memory allocation in an operating system using partitions of different sizes. It compares three allocation strategies: worst-fit, first-fit, and best-fit. For each strategy, it shows how six processes of varying sizes would be allocated to partitions. Worst-fit allocates processes to the partition with the largest remaining space, first-fit to the first partition that fits, and best-fit to the partition that fits with the least remaining space.

    Copyright:

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

    Address (KB) Memory(RAM) Contiguous Allocation

    0 Fixed Partition
    OS
    1 Dynamic Partition
    2 P6(1k)
    3 Assuming that per address/1kB
    4
    5 P5(3K)
    6 P5(3K)
    7 P6(1k)
    8 P3(1k)
    9
    10
    11
    12 P4(7K)
    13
    14
    15
    1K

    P1 P8(3K)
    P11(6K)

    P7

    7K

    P3
    2K
    Partition(KB) Worst-Fit
    Process Size(KB) Allocated 25 25 25
    A 26 Yes P1 P1 P1
    B 10 Yes 97 A(26) A(26)
    C 30 Yes P2 71 B(10)
    D 40 No P5 P2 61
    E 20 Yes 20 P5 P2
    F 5 Yes P3 20 P5
    20 P3 20
    10 P3
    10

    available

    Partition(KB) First-Fit
    Process Size(KB) Allocated 25 25 B(10)
    A 26 Yes P1 P1 15
    B 10 Yes 97 A(26) P1
    C 30 Yes P2 71 A(26)
    D 40 Yes P5 P2 71
    E 20 Yes 20 P5 P2
    F 5 Yes P3 20 P5
    20 P3 20
    20 P3
    20

    Partition(KB) Best-Fit
    Process Size(KB) Allocated 25 25 25
    A 26 Yes P1 P1 P1
    B 10 Yes 97 A(26) A(26)
    C 30 Yes P2 71 71
    D 40 Yes P5 P2 P2
    E 20 Yes 20 P5 P5
    F 5 Yes P3 20 B(10)
    20 P3 10
    20 P3
    20

    Process Size(KB) Memory(KB)


    A 80 P0
    B 55 60
    C 23 P4
    D 5 45
    E 70 P3
    35
    P5
    150
    P6
    100
    Worst-Fit
    25 25 F(5)
    P1 P1 20
    A(26) A(26) P1
    B(10) B(10) A(26)
    C(30) C(30) B(10)
    31 E(20 C(30)
    P2 11 E(20
    P5 P2 11
    20 P5 P2
    P3 20 P5
    10 P3 20
    10 P3
    10
    61

    First-Fit
    B(10) B(10) B(10) B(10)
    15 15 15 F(5)
    P1 P1 P1 10
    A(26) A(26) A(26) P1
    C(30) C(30) C(30) A(26)
    41 D(40) D(40) C(30)
    P2 1 1 D(40)
    P5 P2 P2 1
    20 P5 P5 P2
    P3 20 E(20) P5
    20 P3 P3 E(20)
    20 20 P3
    20
    available 31

    Best-Fit
    25 25 25 25
    P1 P1 P1 P1
    A(26) A(26) A(26) A(26)
    C(30) C(30) C(30) C(30)
    41 D(40) D(40) D(40)
    P2 1 1 1
    P5 P2 P2 P2
    B(10) P5 P5 P5
    10 B(10) B(10) B(10)
    P3 10 10 F(5)
    20 P3 P3 5
    20 E(20) P3
    E(20)
    Available 31

    You might also like