Scribd Logo
Upload

Welcome to Scribd!

  • Process Fcfs Arrival Time Burst Time (MS) Waiting Time Turn Around Time

    Uploaded by

    DIMAS RIO IKBAR FADHOLI 20.11.3548
    8 views4 pages
    The document compares the performance of different CPU scheduling algorithms (FCFS, SJF-NP, SJF-P, RR, PR-NP, PR-P) on a set of 3 processes (P1, P2, P3) of varying burst times and arrival times. It provides metrics like waiting time, turnaround time, and Gantt charts to illustrate the scheduling order under each algorithm.

    Original Description:

    Original Title

    aLGO-sCHEDULING

    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 compares the performance of different CPU scheduling algorithms (FCFS, SJF-NP, SJF-P, RR, PR-NP, PR-P) on a set of 3 processes (P1, P2, P3) of varying burst times and arrival times. It provides metrics like waiting time, turnaround time, and Gantt charts to illustrate the scheduling order under each algorithm.

    Copyright:

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

    Process Fcfs Arrival Time Burst Time (MS) Waiting Time Turn Around Time

    Uploaded by

    DIMAS RIO IKBAR FADHOLI 20.11.3548
    The document compares the performance of different CPU scheduling algorithms (FCFS, SJF-NP, SJF-P, RR, PR-NP, PR-P) on a set of 3 processes (P1, P2, P3) of varying burst times and arrival times. It provides metrics like waiting time, turnaround time, and Gantt charts to illustrate the scheduling order under each algorithm.

    Copyright:

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

    Arrival Burst Time Waiting Turn Around

    Process Time (ms) Time Time FCFS


    P1 0 2 0 2
    P2 2 2 0 2
    P3 3 1 1 2
    rata2 0.333333333 2

    queue
    Gantt Chart
    0 1 2 3 4 5 6 7 8

    Arrival Burst Time Waiting Turn Around


    Process Time (ms) Time Time SJF-NP
    P1 0 3 0 3
    P2 2 2 2 4
    P3 3 1 0 1
    rata2 0.67 2.67

    queue
    Gantt Chart
    0 1 2 3 4 5 6 7 8

    Arrival Burst Time Waiting Turn Around


    Process Time (ms) Time Time SJF-P
    P1 0 5 0+3=3 8
    P2 2 2 0 2
    P3 3 1 1 2
    rata2 1.33 4.00

    queue
    Gantt Chart
    0 1 2 3 4 5 6 7 8
    Arrival Burst Time Waiting Turn Around
    Process Time (ms) Time Time RR
    P1 0 5 0+2+1 =3 8 Q=2
    P2 2 2 0 2
    P3 3 1 3 4
    rata2 2.00 4.67

    queue
    Gantt Chart
    0 1 2 3 4 5 6 7 8

    Arrival Burst Time Waiting Turn Around


    Process Time (ms) Time Time Pr PR-NP
    P1 0 5 0 5 3
    P2 2 2 4 6 2
    P3 3 1 2 3 1
    rata2 2.00 4.67

    queue P2
    Gantt Chart
    0 1 2 3 4 5 6 7 8

    Arrival Burst Time Waiting Turn Around


    Process Time (ms) Time Time Pr PR-P
    P1 0 5 0+3=3 8 3
    P2 2 2 0+1=1 3 2
    P3 3 1 0 1 1
    rata2 1.33 4.00

    queue
    Gantt Chart
    0 1 2 3 4 5 6 7 8
    9

    9
    9

    You might also like