Scribd Logo
Upload

Welcome to Scribd!

  • 31 views

    A. Process Burst Time Arrival Time Completion Waiting

    Uploaded by

    Joseph Escovidal
    This document contains 3 examples of non-preemptive shortest job first (SJF) scheduling. In each example, it lists the processes, their burst times, arrival times, completion times, and waiting times. It then calculates the average waiting time (AWT) for each example. The first example has an AWT of 2.67, the second is 2.75, and the third is the highest at 4.75.

    Copyright:

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

    A. Process Burst Time Arrival Time Completion Waiting

    Uploaded by

    Joseph Escovidal
    31 views1 page
    This document contains 3 examples of non-preemptive shortest job first (SJF) scheduling. In each example, it lists the processes, their burst times, arrival times, completion times, and waiting times. It then calculates the average waiting time (AWT) for each example. The first example has an AWT of 2.67, the second is 2.75, and the third is the highest at 4.75.

    Original Title

    NON-P.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?

    This document contains 3 examples of non-preemptive shortest job first (SJF) scheduling. In each example, it lists the processes, their burst times, arrival times, completion times, and waiting times. It then calculates the average waiting time (AWT) for each example. The first example has an AWT of 2.67, the second is 2.75, and the third is the highest at 4.75.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    31 views1 page

    A. Process Burst Time Arrival Time Completion Waiting

    Uploaded by

    Joseph Escovidal
    This document contains 3 examples of non-preemptive shortest job first (SJF) scheduling. In each example, it lists the processes, their burst times, arrival times, completion times, and waiting times. It then calculates the average waiting time (AWT) for each example. The first example has an AWT of 2.67, the second is 2.75, and the third is the highest at 4.75.

    Copyright:

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

    NON-PREEMPTIVE SJF

    A.
    Process Burst Time Arrival Time Completion Waiting
    P1 4 0 4 0
    P2 2 1 6 3
    P3 3 1 9 5

    P1 P2, P3
    P1 P2 P3
    0 1 2 3 4 5 6 7
    8 9

    Waiting Time:
    P1 = 0 – 0 =0
    P2 = 4 – 1 = 3
    P3 = 6 – 1 = 5

    AWT = 0 + 3 + 5 = 8/3 = 2.67

    B.
    Process Burst Time Arrival Time Completion Waiting
    P1 4 0 7 3
    P2 1 0 1 0
    P3 6 0 13 7
    P4 2 0 3 1

    P1, P2
    P3, P4
    P2 P4 P1 P3
    0 1 2 3 4 5 6 7 8 9 10 11 12 13

    Waiting Time:
    P1 = 3 – 0 = 3
    P2 = 0 – 0 = 0
    P3 = 7 – 0 = 7
    P4 = 1 – 0 = 1

    AWT = 3 + 0 + 7 +1 = 11/4 = 2.75

    C.
    Process Burst Time Arrival Time Completion Waiting
    P1 3 3 9
    P2 5 2 18
    P3 4 4 13
    P4 6 1 6

    P4 P2 P1 P3
    P4 P1 P3 P2
    0 1 2 3 4 6 9 13 18

    WAITING TIME:
    P1 = 6 – 3 = 3
    P2 = 13 – 2 = 11
    P3 = 9 – 4 = 5
    P4 = 1 – 1 = 0

    AWT = 3 + 11 + 5 + 0 = 19/4 = 4.75

    You might also like