1. Consider the following processes along with their burst time in milli seconds(ms) and perform the following. • Draw the Gantt chart • Calculate Waiting Time of each process • Calculate Average waiting time • Calculate Average Turn Around Time using Round Robin Scheduling Algorithm with time quantum 2 ms. Process id Burst time (ms) P1 4 P2 P3 5 P4 6 P5 3 P6

1. Consider the following processes along with their burst time in milli seconds(ms) and perform the following. • Draw the Gantt chart • Calculate Waiting Time of each process • Calculate Average waiting time • Calculate Average Turn Around Time using Round Robin Scheduling Algorithm with time quantum 2 ms. Process id Burst time (ms) P1 4 P2 P3 5 P4 6 P5 3 P6

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the processes with given arrival times, burst times and priorities as below Process Arrival time Burst time Priority P0 0 10 3 P1 0 5 5 P2 10 10 2 P3 10 1 1 Assume the OS is using the following CPU scheduling algorithms. (a) FIFO (b) Round Robin with quantum = 5 ms (c) Priority scheduling Calculate the waiting and turnaround times for each process for each of the algorithms above. Provide the Gantt charts in your answers for each of the algorithms to show the execution of the processes. Fill in the columns in the format below for the waiting time and turnaround time Turnaround time and waiting time Process ID Waiting Time Turnaround Time P1 P2 P3 P4 Average waiting time = Average turnaround time =
At times t = 0, 1, and 2 seconds, processes P1, P2, and P3 arrive in the Ready state, respectively. Suppose their execution times are 5 seconds, 4 seconds, and 3 seconds, respectively. Show how they will be scheduled using round robin scheduling with a quantum of 3 seconds. Calculate the average turnaround time per process.
Given the following table, how will these processes be scheduled using RR algorithm with quantum = 10 ms and context switch time = 2 ms ? Create a Gantt chart showing when each process will be scheduled, and calculate the average waiting time, turnaround time and CPU utilization.
consider the following set of processes , with the length of the CPU burst given in milliseconds: Draw the Gantt charts that illustrate the execution of these processes and compute the average waiting time, average turnaround, average response time using the following scheduling algorithms: 1) FCFS 2)Primitive SJF Process, burst time, arrival time P3 2 0 P2 4 1 P5 5 2 P1 10 3 P4 1 4
P1, P2, P3 and P4 are five processes arriving at different times of 0, 1, 5, 6. Each processhas a burst time of 2, 2, 3 and 4 respectively. Compute the average waiting time and drawthe Gantt chart illustrating the process executions using First-Come-First-Serve scheduling.
Question no 2: Consider the following set of four processes. Their arrival time and time to require completing the execution are given in the following table. Consider all times in milliseconds. Implement the SJF algorithm on the given chart. Process Arrival Time (T0) Time required for completion (CPU Burst Time) P0 0 10 P1 1 6 P2 3 2 P3 5 4
Solve A and B Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Arrival Time CPU Burst Time/ Service Time/ Processing Time Priority P1 0 3 2 P2 1 5 3 P3 2 2 1 P4 3 3 3 P5 4 4 4 a) Draw the Gantt charts illustrating the execution of these processes using: 1. FCFS 2. SJF (SPN) 3. SRT 4. HRRN 5. a nonpreemptive priority (a smaller priority number implies a higher priority) 6. RR (q= 1) 7. RR (q= 3) 8. Combining RR (q=2) and priority scheduling 9. Feedback (q=1) 10. Feedback (q=2i) b) Fill out the following table for each of the scheduling algorithms in part a. Process Arrival Time Starting Time Completion Time Response Time Waiting Time Turnaround Time P1 0 P2 1 P3 2 P4 3 P5 4 Average
How would it be advantageous to prioritize the I/O queue above the process execution queue? If the I/O connection fails, who knows what will occur. No one knows how this could effect the CPU's maximum burst rate. I'm confused as to the nature of your question.
Draw the Gantt chart, Calculate the Average Turnaround Time AND Average Waiting Time for the following processes using FCFS Scheduling. Processes Arrival Time CPU Burst Time P1 0 6 P2 1 4 P3 2 3 P4 3 2
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Arrival Time CPU Burst Time/ Service Time/ Processing Time Priority P1 0 3 2 P2 1 5 3 P3 2 2 1 P4 3 3 3 P5 4 4 4 Draw the Gantt charts illustrating the execution of these processes using: FCFS SJF (SPN) SRT HRRN a nonpreemptive priority (a smaller priority number implies a higher priority) RR (q= 1) RR (q= 3) Combining RR (q=2) and priority scheduling Feedback (q=1) Feedback (q=2i)
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Arrival Time CPU Burst Time/ Service Time/ Processing Time Priority P1 0 3 2 P2 1 5 3 P3 2 2 1 P4 3 3 3 P5 4 4 4 Draw the Gantt charts illustrating the execution of these processes using: FCFS SJF (SPN) SRT HRRN a nonpreemptive priority (a smaller priority number implies a higher priority) RR (q= 1) RR (q= 3) Combining RR (q=2) and priority scheduling Feedback (q=1) Feedback (q=2i) Fill out the following table for each of the scheduling algorithms in part a. Process Arrival Time Starting Time Completion Time Response Time Waiting Time Turnaround Time P1 0 P2 1 P3 2 P4 3 P5 4 Average
Consider the following set of four processes. Their arrival time and time to require completing the execution are given in the following table. Consider all times in milliseconds. Implement the SJF algorithm on given chart. Process Arrival Time (T0) Time required for completion (CPU Burst Time) P0 0 10 P1 1 6 P2 3 2 P3 5 4