2. Consider the following processes along with their burst time in milliseconds(ms). • Draw the Gantt chart • Calculate Waiting Time of each process • Calculate Average waiting time • Calculate Average Turn Around Time using SJF Non Preemptive Scheduling Algorithm? Process id Burst time (ms) P1 2 P2 3 P3 1 P4 6. P5 3 P6 4

2. Consider the following processes along with their burst time in milliseconds(ms). • Draw the Gantt chart • Calculate Waiting Time of each process • Calculate Average waiting time • Calculate Average Turn Around Time using SJF Non Preemptive Scheduling Algorithm? Process id Burst time (ms) P1 2 P2 3 P3 1 P4 6. P5 3 P6 4

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 process arrival, CPU and I/O burst times. Assumethat only one I/O device is available and it operates in FCFS manner. Ignorethe switching times for both the CPU and I/O device. Assume that there isonly one CPU and it uses shortest remaining time first (SRTF, preemptive)scheduling algorithm. show the picture to see full question.................
Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use nonpreemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time Pl 0.0 8 P2 0.4 4 P3 1.0 1 a. What is the average turnaround time for these processes with the FCFS scheduling algorithm?b. What is the average turnaround time for these processes with the SJF scheduling algorithm? c. The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not k11ow that two shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1 and P2 are waiting during this idle time, so their waiting time may increase. This algorithm could be known as future-knowledge…
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
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.
1. Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst TimeP1 0 8P2 4 4P3 10 1a. Draw the Gantt chart for the above using FCFS scheduling algorithm b. Draw the Gantt chart for the above using SJF non-preemptive scheduling algorithm. c. What is the average waiting time for these processes with the FCFS scheduling and SJF non-preemptive algorithms? d. What are the 2 major activities of an operating system with regards to process management? e. Which of the following instructions should be privileged? Read the clock.Clear memory. f. What is the purpose of system…
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.
Three processes and their service times are P1 = 200, P2 = 125, P3 = 70 are to be scheduled to run using the Round Robin Scheduling algorithm with a time slice of 50. Calculate the Turn Around Time for P2 (Assume they get scheduled to run in the order P1, p2, p3). a. 395 b. 345 c. 250 d. 270 e. 125
When feasible, what advantages does it provide to move process execution to the I/O queue first? If the I/O connection suddenly drops, what do you expect to happen? How would this affect the fastest possible CPU burst rate? I'm not sure I get what you're trying to say.
ProcessBurst Time Priority Arrival TimeP1 10 3 0P2 1 1 0P3 2 5 0P4 1 4 0P5 5 2 0For the set of processes directly above, draw a Gantt chart for the FCFS Scheduling Algorithm.
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.
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.
A deadlock occurs in an operating system when a process enters an endless waiting state due to another process holding a requested resource. Suggest THREE (3) strategies to avoid a stalemate, and use examples from the actual world to illustrate each one.