3. Assume that there are SIX (6) processes with id, arrival time and burst time as shown below (see Table 1). Table 1 Arrival Time Process P1 P2 Burst Time 3 P3 1 3 P4 1 P5 4 6. P6 6. 4 a) Based on the above information, draw the Gantt chart for the following algorithms: i. Round Robin Algorithm (Time Quantum: 4 milliseconds) ii. Shortest Remaining Time (SRT) b) What is the turnaround time of each process for Round Robin Algorithm? c) What is the waiting time of each process for each of the scheduling algorithm in Q3(a)? d) Which of the algorithms in Q3(a) results is the minimum average waiting time? e) Which of the algorithms in Q3(a) is the best algorithm? Justify your answer.

3. Assume that there are SIX (6) processes with id, arrival time and burst time as shown below (see Table 1). Table 1 Arrival Time Process P1 P2 Burst Time 3 P3 1 3 P4 1 P5 4 6. P6 6. 4 a) Based on the above information, draw the Gantt chart for the following algorithms: i. Round Robin Algorithm (Time Quantum: 4 milliseconds) ii. Shortest Remaining Time (SRT) b) What is the turnaround time of each process for Round Robin Algorithm? c) What is the waiting time of each process for each of the scheduling algorithm in Q3(a)? d) Which of the algorithms in Q3(a) results is the minimum average waiting time? e) Which of the algorithms in Q3(a) is the best algorithm? Justify your answer.

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 following processes with the given CPU arrival time and burst time. Please use the round-robin with quantum 10 to make a Gantt chart.
please answer b Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 5 4 P2 3 1 P3 1 2 P4 7 2 P5 4 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. b.What is the turnaround time of each process for SJF and RR algorithms?
Consider the following four processes with the length of CPU burst time in milliseconds (P1: 20, P2:15, P3:10, P4:5 ms). Calculate the average waiting time by using following algorithms FCFS ALGORITHM. 1. RR ROUND ROBIN (TIME QUANTUM 10 MS)
Consider the FIVE (5)process with their CPU burst time and arrival time. Process Arrival Time CPU burst time P0 0 1 P1 2 3 P2 1 4 P3 1 3 P4 3 2 Based on the above data, answer the following Calculate the turn-around time for SRT algorithm. Calculate average turn-around time for SRT algorithm. Calculate the response time for SJF. Calculate the waiting time for SJF. Which algorithm is the best among SJF and SRT? Justify your answer.
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
Consider the following processes with the given CPU arrival time and burst time. Please use the round-robin with quantum 10 to compute for the waiting times for each process.
Consider the following processes with the given CPU arrival time and burst time. Please use the shortest remaining time first algorithm to make a Gantt chart.
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 =
Consider the FIVE (5)process with their CPU burst time and arrival time. Process Arrival Time CPU burst time P0 0 1 P1 2 3 P2 1 4 P3 1 3 P4 3 2 Based on the above data, answer the following Draw a time line for the following algorithm: Shortest Job First (SJF) Shortest Remaining Time (SRT)
Consider the following set of processes, with the length of the CPU burst given in milliseconds Draw the Gantt Chart and calculate the Waiting time and the turnaround time. Upload the solution as a file
Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5 all at time 0. a. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part i? c. Which of the algorithms results in the minimum average waiting time (over all processes)?
Given 4 processes P1, P2,P3,P4 with burst time 4,5,8,1 respectively. What will be the order in which the processes are scheduled according to SJF Algorithm. Assume that all the processes are available at t=0.