Scribd Logo
Upload

Welcome to Scribd!

  • FCFS SJF SP

    Uploaded by

    Prima
    32 views5 pages
    The document describes three scheduling algorithms: 1) First Come First Served (FCFS) scheduling where processes are executed in the order of arrival with an average waiting time (AWT) of 2.3 ms based on the example. 2) Shortest Job First (SJF) scheduling where the shortest process is executed first with an AWT of 2.3 ms. 3) Priority scheduling where processes are executed based on priority with the highest priority process going first and an AWT of 2.3 ms.

    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 three scheduling algorithms: 1) First Come First Served (FCFS) scheduling where processes are executed in the order of arrival with an average waiting time (AWT) of 2.3 ms based on the example. 2) Shortest Job First (SJF) scheduling where the shortest process is executed first with an AWT of 2.3 ms. 3) Priority scheduling where processes are executed based on priority with the highest priority process going first and an AWT of 2.3 ms.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    32 views5 pages

    FCFS SJF SP

    Uploaded by

    Prima
    The document describes three scheduling algorithms: 1) First Come First Served (FCFS) scheduling where processes are executed in the order of arrival with an average waiting time (AWT) of 2.3 ms based on the example. 2) Shortest Job First (SJF) scheduling where the shortest process is executed first with an AWT of 2.3 ms. 3) Priority scheduling where processes are executed based on priority with the highest priority process going first and an AWT of 2.3 ms.

    Copyright:

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

    First - Come - First - Served Scheduling ( FCFS )

    Contoh 1 PROSES BURST TIME WAKTU PROSES


    P1 10 2
    P2 4 6
    P3 8 14
    P4 6 20
    P5 2 30
    30 72

    ∑ Waktu Proses
    AWT =
    ∑ Burst Time
    70
    AWT =
    30

    AWT = 2.33333333333333

    AWT = 2,3 ms

    10 4 8 6 2
    2 6 14 20 30
    P3 P4 P2 P5 P1

    PRIORITY SCHEDU

    Contoh 3 PROSES
    P1
    P2
    P3
    P4
    P5

    AWT =

    AWT =

    AWT =

    AWT =
    10 8
    10 18
    P1 P3
    Shortest Job First Scheduler ( SJF )

    Contoh 2 PROSES BURST TIME WAKTU PROSES


    P1 10 30
    P2 4 6
    P3 8 20
    P4 6 12
    P5 2 2
    30 70

    ∑ Waktu Proses
    AWT =
    ∑ Burst Time
    70
    AWT =
    30

    AWT = 2.33333333333333

    AWT = 2,3 ms

    2 4 6 8
    2 6 12 20
    P5 P2 P4 P3

    PRIORITY SCHEDULING

    BURST TIME WAKTU PROSES


    10 10
    4 28
    8 18
    6 24
    2 30
    30 110

    ∑ Waktu Proses
    ∑ Burst Time
    70
    30

    2.33333333333333

    2,3 ms
    6 4 2
    24 29 30
    P4 P2 P5
    r ( SJF )

    10
    30
    P1

    You might also like