Scribd Logo
Upload

Welcome to Scribd!

  • Forum 3 Scheduller Mochamad - Faishal - Amir Rev1

    Uploaded by

    Mochamad Faishal Amir
    7 views12 pages
    The document describes simulations of different scheduling algorithms including first come first served, shortest job first, priority scheduling, and round robin. It provides Gantt charts showing the process schedules for each algorithm under different scenarios where processes have varying burst times. The simulations explore how the different scheduling techniques allocate CPU time for the processes.

    Original Description:

    Original Title

    Forum-3-Scheduller-Mochamad_Faishal_Amir-rev1

    Copyright

    © © All Rights Reserved

    Available Formats

    XLS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes simulations of different scheduling algorithms including first come first served, shortest job first, priority scheduling, and round robin. It provides Gantt charts showing the process schedules for each algorithm under different scenarios where processes have varying burst times. The simulations explore how the different scheduling techniques allocate CPU time for the processes.

    Copyright:

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

    Forum 3 Scheduller Mochamad - Faishal - Amir Rev1

    Uploaded by

    Mochamad Faishal Amir
    The document describes simulations of different scheduling algorithms including first come first served, shortest job first, priority scheduling, and round robin. It provides Gantt charts showing the process schedules for each algorithm under different scenarios where processes have varying burst times. The simulations explore how the different scheduling techniques allocate CPU time for the processes.

    Copyright:

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

    Nama: Mochamad Faishal Amir

    Eksperimen Scheduling 01

    Simulasi 1, (Asumsi semua proses memiliki arrival time 0, dan context switch time 0)

    Process Arrival Time Burst Time 1. First Come First Served (FCFS)
    P1 0 4
    P2 0 8 Gantt Chart
    P3 0 3
    P4 0 2 P1
    P5 0 7 0 4

    2. Shortest Job First (SJF)

    Gantt Chart

    P4
    0 2

    3. Priority Scheduling (diasumsikan

    Gantt Chart

    P1
    0 4

    4. Round Robin (diasumsikan quant

    Gantt Chart

    P1
    0 2

    *note P1 = 2

    Simulasi 2, (Asumsi semua proses memiliki arrival time 0, dan context switch time 0)

    Process Arrival Time Burst Time 1. First Come First Served (FCFS)
    P1 0 2
    P2 0 3 Gantt Chart
    P3 0 4
    P4 0 7 P1
    P5 0 8 0 2

    2. Shortest Job First (SJF)

    Gantt Chart

    P1
    0 2

    3. Priority Scheduling (diasumsikan

    Gantt Chart

    P1
    0 2

    4. Round Robin (diasumsikan quant

    Gantt Chart

    P1
    0 2

    *note P1 = 0

    Simulasi 3, (Asumsi semua proses memiliki arrival time 0, dan context switch time 0)

    Process Arrival Time Burst Time 1. First Come First Served (FCFS)
    P1 0 8
    P2 0 7 Gantt Chart
    P3 0 4
    P4 0 3 P1
    P5 0 2 0 8

    2. Shortest Job First (SJF)


    Gantt Chart

    P5
    0 2

    3. Priority Scheduling (diasumsikan

    Gantt Chart

    P1
    0 8

    4. Round Robin (diasumsikan quant

    Gantt Chart

    P1
    0 2

    *note P1 = 6
    me First Served (FCFS)

    P2 P3 P4 P5
    4 12 15 17 24

    t Job First (SJF)

    P3 P1 P5 P2
    2 5 9 16 24

    Scheduling (diasumsikan prioritas diurutkan dari P1-P5)

    P2 P3 P4 P5
    4 12 15 17 24

    Robin (diasumsikan quantum sebesar 5)

    P2 P3 P4 P5 P1
    2 4 6 8 10 12

    P2 = 6 P3 = 1 P4 = 0 P5 = 5 P1 = 0

    me First Served (FCFS)


    P2 P3 P4 P5
    2 5 9 16 24

    t Job First (SJF)

    P2 P3 P4 P5
    2 5 9 16 24

    Scheduling (diasumsikan prioritas diurutkan dari P1-P5)

    P2 P3 P4 P5
    2 5 9 16 24

    Robin (diasumsikan quantum sebesar 5)

    P2 P3 P4 P5 P2
    2 4 6 8 10 11

    P2 = 1 P3 = 2 P4 = 5 P5 = 6 P2 = 0

    me First Served (FCFS)

    P2 P3 P4 P5
    8 15 19 22 24

    t Job First (SJF)


    P4 P3 P2 P1
    2 5 9 16 24

    Scheduling (diasumsikan prioritas diurutkan dari P1-P5)

    P2 P3 P4 P5
    8 15 19 22 24

    Robin (diasumsikan quantum sebesar 5)

    P2 P3 P4 P5 P1
    2 4 6 8 10 12

    P2 = 5 P3 = 2 P4 = 1 P5 = 0 P1 = 4
    P2 P3 P5 P2 P5
    12 14 15 17 19 21

    P2 = 4 P3 = 0 P5 = 3 P2 = 2 P5 = 1
    P3 P4 P5 P4 P5
    11 13 15 17 19 21

    P3 = 0 P4 = 3 P5 = 4 P4 = 1 P5 = 2
    P2 P3 P4 P1 P2
    12 14 16 17 19 21

    P2 = 3 P3 = 0 P4 = 0 P1 = 2 P2 = 1
    P2 P5
    21 23 24

    P2 = 0 P5 = 0
    P4 P5
    21 22 24

    P4 = 0 P5 =0
    P1 P2
    21 23 24

    P1 = 0 P2 =0

    You might also like