Scribd Logo
Upload

Welcome to Scribd!

  • SJF Preemptive

    Uploaded by

    Ahmad Yusron
    9 views4 pages
    This document contains information about two examples of scheduling processes using the Shortest Job First (SJF) preemptive algorithm. The first example schedules 4 processes (P1, P2, P3, P4) with burst times of 10, 2, 5, and 8 and arrival times of 0, 1, 3, 2. It calculates the average waiting time as 5 and average turnaround time as 11.5. The second example schedules 4 processes with burst times of 8, 2, 3, 6 and arrival times of 0, 1, 2, 3, and calculates average waiting time as 3.75 and average turnaround time as 8.5.

    Original Description:

    Original Title

    SJF PREEMPTIVE.pptx

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains information about two examples of scheduling processes using the Shortest Job First (SJF) preemptive algorithm. The first example schedules 4 processes (P1, P2, P3, P4) with burst times of 10, 2, 5, and 8 and arrival times of 0, 1, 3, 2. It calculates the average waiting time as 5 and average turnaround time as 11.5. The second example schedules 4 processes with burst times of 8, 2, 3, 6 and arrival times of 0, 1, 2, 3, and calculates average waiting time as 3.75 and average turnaround time as 8.5.

    Copyright:

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

    SJF Preemptive

    Uploaded by

    Ahmad Yusron
    This document contains information about two examples of scheduling processes using the Shortest Job First (SJF) preemptive algorithm. The first example schedules 4 processes (P1, P2, P3, P4) with burst times of 10, 2, 5, and 8 and arrival times of 0, 1, 3, 2. It calculates the average waiting time as 5 and average turnaround time as 11.5. The second example schedules 4 processes with burst times of 8, 2, 3, 6 and arrival times of 0, 1, 2, 3, and calculates average waiting time as 3.75 and average turnaround time as 8.5.

    Copyright:

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

    SJF (PREEMPTIVE)

    Proses Brust Time Wkt kedatangan


    P1 10 0
    P2 2 1
    P3 5 3
    P4 8 2

    P1 P2 P2 P3 P4 P1

    0 1 2 3 8 16 25
    Waiting Time : P1 = 0+15 = 15
    P2 = 0 – 1 = -1
    P3 = 3-3 = 0
    P4 = 8-2 = 6
    Average Waiting Time : (15+(-1)+0+6=20/4= 5)
    Turn Around Time : P1 = 25 – 0 = 25
    P2 = 3 – 1 = 2
    P3 = 8 – 3 = 5
    P4 = 16 – 2 = 14
    Average Turn Around Time : (25+2+5+14= 46/4 = 11,5)
    SJF (PREEMPTIVE)
    Proses Brust Time Wkt kedatangan
    P1 8 0
    P2 2 1
    P3 3 2
    P4 6 3

    P1 P2 P2 P3 P4 P1

    0 1 2 3 6 12 19
    Waiting Time : P1 = 0+11 = 11
    P2 = 0 – 1 = -1
    P3 = 3-2 = 1
    P4 = 6-2 = 4
    Average Waiting Time : (11+(-1)+1+4=15/4= 3,75)
    Turn Around Time : P1 = 19 – 0 = 19
    P2 = 3 – 1 = 2
    P3 = 6 – 2 = 4
    P4 = 12 – 3 = 9
    Average Turn Around Time : (19+2+4+9= 34/4 = 8,5)

    You might also like