Scribd Logo
Upload

Welcome to Scribd!

  • 149 views

    206 Scheduling Problems

    Uploaded by

    Nirmal Jain
    The document provides four examples of sets of processes with arrival times and CPU burst times. It asks to draw Gantt charts and compute performance metrics for each set of processes under FCFS, SJF, priority, and round robin scheduling algorithms. The goal is to practice scheduling algorithms by analyzing the sample processes.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    206 Scheduling Problems

    Uploaded by

    Nirmal Jain
    149 views2 pages
    The document provides four examples of sets of processes with arrival times and CPU burst times. It asks to draw Gantt charts and compute performance metrics for each set of processes under FCFS, SJF, priority, and round robin scheduling algorithms. The goal is to practice scheduling algorithms by analyzing the sample processes.

    Original Title

    206_SCHEDULING_PROBLEMS.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document provides four examples of sets of processes with arrival times and CPU burst times. It asks to draw Gantt charts and compute performance metrics for each set of processes under FCFS, SJF, priority, and round robin scheduling algorithms. The goal is to practice scheduling algorithms by analyzing the sample processes.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    149 views2 pages

    206 Scheduling Problems

    Uploaded by

    Nirmal Jain
    The document provides four examples of sets of processes with arrival times and CPU burst times. It asks to draw Gantt charts and compute performance metrics for each set of processes under FCFS, SJF, priority, and round robin scheduling algorithms. The goal is to practice scheduling algorithms by analyzing the sample processes.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 2

    Scheduling for practice purpose

    Consider the following set of processes, with the length of CPU burst time given in milliseconds.
    Process Arrival Time Burst Time Priority
    P1 0 8 4
    P2 1 6 3
    P3 2 4 2
    P4 3 2 1

    Draw the Gantt charts illustrating the execution of these processes using
    1. FCFS
    2. SJF – Preemptive & Nonpreemptive
    3. Priority-Preemptive & Nonpreemptive
    4. Round Robin TS=1,2
    Compute finish, turnaround and waiting time of each process for above all scheduling
    algorithms.

    2. Consider the following set of processes, with the length of CPU burst time given in
    milliseconds.
    Process Arrival Time Burst Time Priority
    P1 0 8 3
    P2 1 1 1
    P3 2 3 2
    P4 3 2 3

    P5 4 6 4

    Draw the Gantt charts illustrating the execution of these processes using
    1. FCFS
    2. SJF – Preemptive & Nonpreemptive
    3. Priority-Preemptive & Nonpreemptive
    4. Round Robin TS=2,4
    Compute finish, turnaround and waiting time of each process for above all scheduling
    algorithms.
    Consider the following set of processes, with the length of CPU burst time given in milliseconds.
    Process Arrival Time Burst Time Priority
    P1 0 8 3
    P2 2 1 1
    P3 3 3 2
    P4 4 2 3

    P5 5 6 4

    Draw the Gantt charts illustrating the execution of these processes using
    1. FCFS
    2. SJF – Preemptive & Nonpreemptive
    3. Priority-Preemptive & Nonpreemptive
    4. Round Robin TS=1,2
    Compute finish, turnaround and waiting time of each process for above all scheduling
    algorithms.

    Consider the following set of processes, with the length of CPU burst time given in milliseconds.
    Process Arrival Time Burst Time Priority
    A 0 3 2
    B 1 5 1
    C 3 2 3
    D 9 5 4
    E 12 5 4

    Draw the Gantt charts illustrating the execution of these processes using
    1. FCFS
    2. SJF – Preemptive & Nonpreemptive
    3. Priority-Preemptive & Nonpreemptive
    4. Round Robin TS=1,2
    Compute finish, turnaround and waiting time of each process for above all scheduling
    algorithms.

    You might also like