Scribd Logo
Upload

Welcome to Scribd!

  • Gantt Chart

    Uploaded by

    Chicha Kaya
    5 views4 pages
    The document contains four Gantt charts showing different scheduling algorithms: non-preemptive priority scheduling, preemptive priority scheduling, and multi-level queue scheduling. The non-preemptive priority scheduling charts show processes of different priorities running to completion. The preemptive priority scheduling chart shows a higher priority process preempting a lower priority process. The multi-level queue chart shows processes in two queues, one using round robin scheduling and the other using FCFS. Formulas for calculating turnaround time and wait time are also presented.

    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 contains four Gantt charts showing different scheduling algorithms: non-preemptive priority scheduling, preemptive priority scheduling, and multi-level queue scheduling. The non-preemptive priority scheduling charts show processes of different priorities running to completion. The preemptive priority scheduling chart shows a higher priority process preempting a lower priority process. The multi-level queue chart shows processes in two queues, one using round robin scheduling and the other using FCFS. Formulas for calculating turnaround time and wait time are also presented.

    Copyright:

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

    Gantt Chart

    Uploaded by

    Chicha Kaya
    The document contains four Gantt charts showing different scheduling algorithms: non-preemptive priority scheduling, preemptive priority scheduling, and multi-level queue scheduling. The non-preemptive priority scheduling charts show processes of different priorities running to completion. The preemptive priority scheduling chart shows a higher priority process preempting a lower priority process. The multi-level queue chart shows processes in two queues, one using round robin scheduling and the other using FCFS. Formulas for calculating turnaround time and wait time are also presented.

    Copyright:

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

    TIMELINE / GANTT CHART

    Non-Preemtive Priority Scheduling


    ProcessAT CB Prio
    P1 17 3 0 6 9
    P2 3 2
    P3 6 1
    P4 2 4

    ProcessAT CB Prio
    P1 0 17 3 0
    P2 1 3 2
    P3 2 6 1
    P4 3 2 4

    ProcessAT CB Prio
    P1 0 8 4 0 8 13
    P2 3 4 3
    P3 4 5 1
    P4 6 3 2
    P5 10 2 2

    Preemtive Priority Scheduling


    ProcessAT CB Prio
    P1 0 17 3 0 1 2 3 8 10
    P2 1 3 2
    P3 2 6 1
    P4 3 2 4

    ProcessAT CB Prio
    P1 0 8 4
    P2 3 4 3 0 3 4 6 9 10 12 14
    P3 4 5 1
    P4 6 3 2
    P5 10 2 2

    TT = Time Finished - Arrival Time


    WT = TT - CPU Burst
    Multi-Level Queue (Q1 - RR QT = 2, Q2 - FCFS)
    ProcessCB Queue AT
    P1 5 1 0
    P2 3 1 0 0 2 4 6 7 8 10 12
    P3 8 2 0
    P4 2 1 10

    Multi-Level TT and WT
    TT = Time Finished - Arrival Time
    WT = TT - CPU Burst
    RULES:
    26 28 Low number, High Prior
    If PT is the same, follow Arriv
    If a job will arrive during processing time, f
    next processes

    17 23 26 28

    16 18 22

    RULES
    Job on process will be terminated if the
    26 28 during the process.
    If PT is the same, follow Arriv

    17 22

    18
    RULES:
    Low number, High Priority
    PT is the same, follow Arrival time
    ve during processing time, follow prioty time for
    next processes

    RULES
    ess will be terminated if there is incoming job
    during the process.
    PT is the same, follow Arrival time

    You might also like