Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Prak2 5221600041 Daffa Hanif A.P

    Uploaded by

    Kentang Gaming03
    The document summarizes several scheduling algorithms and provides examples of how each algorithm schedules sample job data. It compares the First Come First Serve (FCFS), Round Robin (RR), Shortest Job First (SJF) preemptive and non-preemptive algorithms. For each algorithm, it shows the Gantt chart schedule, job details, total waiting time, and average turnaround time. It provides 4 exercises with sample job data to compare the performance of RR and SJF preemptive algorithms.

    Copyright:

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

    You might also like

    Prak2 5221600041 Daffa Hanif A.P

    Uploaded by

    Kentang Gaming03
    6 views7 pages
    The document summarizes several scheduling algorithms and provides examples of how each algorithm schedules sample job data. It compares the First Come First Serve (FCFS), Round Robin (RR), Shortest Job First (SJF) preemptive and non-preemptive algorithms. For each algorithm, it shows the Gantt chart schedule, job details, total waiting time, and average turnaround time. It provides 4 exercises with sample job data to compare the performance of RR and SJF preemptive algorithms.

    Original Description:

    Original Title

    Prak2 5221600041 Daffa Hanif a.P

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes several scheduling algorithms and provides examples of how each algorithm schedules sample job data. It compares the First Come First Serve (FCFS), Round Robin (RR), Shortest Job First (SJF) preemptive and non-preemptive algorithms. For each algorithm, it shows the Gantt chart schedule, job details, total waiting time, and average turnaround time. It provides 4 exercises with sample job data to compare the performance of RR and SJF preemptive algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    6 views7 pages

    Prak2 5221600041 Daffa Hanif A.P

    Uploaded by

    Kentang Gaming03
    The document summarizes several scheduling algorithms and provides examples of how each algorithm schedules sample job data. It compares the First Come First Serve (FCFS), Round Robin (RR), Shortest Job First (SJF) preemptive and non-preemptive algorithms. For each algorithm, it shows the Gantt chart schedule, job details, total waiting time, and average turnaround time. It provides 4 exercises with sample job data to compare the performance of RR and SJF preemptive algorithms.

    Copyright:

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

    LAPORAN ARSITEKTUR JARINGAN

    KOMPUTER

    Disusun oleh:
    DAFFA HANIF A.P
    5221600041 /GTB
    PROGRAM STUDI D4 TEKNOLOGI GAME

    DEPARTEMEN TEKNIK MULTIMEDIA KREATIF

    POLITEKNIK ELEKTRONIKA NEGERI SURABAYA

    2022/2023
    Latihan 1
    1. Algoritma FCFS

    Gantt Chart
    P1 P2 P3 P4
    0 10 13 15

    Job Arrival Burst Finish Waiting Turnaround


    Time Time Time Time Time

    P1 0 10 10 0 10 - 0 = 10

    P2 1 3 13 10 - 1 = 9 13 - 1 = 12

    P3 3 2 15 13 - 3 = 10 15 - 3 = 12

    P4 5 6 21 15 - 5 = 10 21 - 6 = 16

    Total 29 ms 50 ms

    Rata - rata 7.25 ms 12,5 ms

    2. Algoritma RR (Quantum Slice: 3ms)

    P1 P2 P3 P1 P4 P1 P4 P1
    0 3 6 8 11 14 17 20 21

    Job Arrival Burst Finish Waiting Time Turnaround


    Time Time Time Time

    P1 0 10 21 (8 - 3) + (14 - 11) + (20 - 17) = 11 21 - 0 = 21

    P2 1 3 6 3-1=2 6-1=5

    P3 3 2 8 6-3=3 8-3=5

    P4 5 6 20 (11 - 5) + (17 -14) = 9 20 - 5 = 15

    Total 25 ms 46 ms

    Rata - rata 6.25 ms 11.5 ms


    3. Algoritma SJF Non-Preemptive

    Gantt Chart
    P1 P2 P3 P4
    0 10 12 15 21

    Job Arrival Burst Finish Waiting Turnaround


    Time Time Time Time Time

    P1 0 10 10 0 10

    P2 1 3 15 12 - 1 = 11 15 - 1 = 14

    P3 3 2 12 10 - 3 = 7 12 - 3 = 9

    P4 5 6 21 15 - 5 = 10 21 - 5 = 16

    Total 28 49

    Rata - rata 7 ms 12.25 ms

    4. Algoritma SJF Preemptive

    Gantt Chart
    P1 P2 P3 P4 P1
    0 1 4 6 12 21

    Job Arrival Burst Finish Waiting Turnaround


    Time Time Time Time Time

    P1 0 10 21 12 - 1 = 11 21

    P2 1 3 4 1-1=0 4-1=3

    P3 3 2 6 4-3=1 6-3=3

    P4 5 6 12 6-5=1 12 - 5 = 7

    Total 13 ms 34 ms

    Rata - rata 3.25 ms 6.5 ms


    Latihan 2
    1. Algoritma RR (Quantum Slice: 5ms)

    Gantt Chart
    P1 P2 P3 P4 P1
    0 5 9 10 14 16

    Job Arrival Burst Finish Waiting Turnaround


    Time Time Time Time Time

    P1 0 7 16 14 - 5 = 9 16

    P2 2 4 9 5-2=3 9-2=7

    P3 4 1 10 9-4=5 10 - 4 = 6

    P4 5 4 14 10 - 5 = 5 14 - 5 = 9

    Total 22 ms 38 ms

    Rata - rata 4.5 ms 9.5 ms

    2. Algoritma SJF Preemptive

    Gantt Chart
    P1 P2 P3 P2 P4 P1
    0 2 4 5 7 11 16

    Job Arrival Burst Finish Waiting Time Turnaround


    Time Time Time Time

    P1 0 7 16 11 - 2 = 9 16

    P2 2 4 7 2 + (5 - 4) = 3 7-2=5

    P3 4 1 5 4-4=0 5-4=1

    P4 5 4 11 7-5=2 11 - 5 = 6

    Total 14 ms 28 ms

    Rata - rata 3.5 ms 7 ms


    Latihan 3
    1. Algoritma RR (Quantum Slice: 5ms)
    Gantt Chart
    P1 P2 P3 P4 P1 P2
    0 5 10 11 16 21 24

    Job Arrival Burst Finish Time Waiting Time Turnaround


    Time Time Time

    P1 0 10 21 16 - 5 = 11 21

    P2 3 8 24 (5 - 3) + (21 - 10) = 13 24 - 3 = 21

    P3 4 1 11 10 - 4 = 6 11 - 4 = 7

    P4 7 5 16 11 - 7 = 4 16 - 7 = 9

    Total 34 ms 58 ms

    Rata - rata 8.5 ms 14.5 ms

    2. Algoritma SJF Preemptive

    Gantt Chart
    P1 P3 P1 P4 P1 P2
    0 4 5 7 12 16 24

    Job Arrival Burst Finish Waiting Time Turnaround


    Time Time Time Time

    P1 0 10 16 (5 - 4) + (12 - 7) = 6 16

    P2 3 8 24 16 - 3 = 13 24 - 3 = 21

    P3 4 1 5 4-4=0 5-4=1

    P4 7 5 12 7-7=0 12 - 7 = 5

    Total 19 ms 43 ms

    Rata - rata 4.75 ms 10.75 ms


    Latihan 4
    a. Data 1
    Job Burst Finish Waiting Time Turnaround
    Time Time Time

    P1 10 10 0 10

    P2 18 28 10 28

    P3 5 33 28 33

    P4 20 53 33 53

    P5 18 71 53 71

    Total 124 ms 195 ms

    Rata - rata 24.8 ms 39 ms

    Gantt Chart
    P1 P2 P3 P4 P5
    0 10 28 33 53 71
    b. Data 2

    Job Burst Finish Waiting Time Turnaround


    Time Time Time

    P1 55 55 0 55

    P2 5 60 55 60

    P3 42 102 60 102

    P4 20 122 102 122

    P5 17 139 122 139

    P6 41 179 139 180

    Total 478 ms 658 ms

    Rata - rata 79.7 ms 109.6 ms

    Gantt Chart
    P1 P2 P3 P4 P5 P6
    0 55 60 102 122 139 180

    You might also like