Consider the following processes and answer the questions, the burst time for processes p1 to p4 is the last 4 numbers of your university ID. le. If your id number 201911446| Process name Arrival time Burst Time Proiarity P1 P2 1 4 3 P3 2 4 1 P4 3 6. 2 Show your work What will be the waiting time for p3 if we applied preemptive SJF scheduling

Consider the following processes and answer the questions, the burst time for processes p1 to p4 is the last 4 numbers of your university ID. le. If your id number 201911446| Process name Arrival time Burst Time Proiarity P1 P2 1 4 3 P3 2 4 1 P4 3 6. 2 Show your work What will be the waiting time for p3 if we applied preemptive SJF scheduling

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

An interactive system using round-robin scheduling and swapping tries to giveguaranteed response to trivial requests as follows: After completing a round robin cycleamong all ready processes, the system determines the time slice to allocate to eachready process for the next cycle by dividing a maximum response time by the number ofprocesses requiring service. Is this a reasonable policy?
Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this order. The processes have the following service times (in time units): Process P1 P2 P3 P4 Service time (CPU burst) 53 17 68 24 For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround time) and the number of context switches. The time quantum q is set to 20 time units. You must show your calculations. You will not have to draw Gantt charts. Note: For RR, processes execute in order of their ID (i.e., P1-P2-P3-P4).
Consider three processes (process id 0, 1, 2 respectively) with computing bursts timeunits of 3, 4 and 7 respectively. All processes arrive at the same time. Consider thescheduling algorithm with the longest remaining time first (LRTF). In LRTF ties arebroken by giving priority to the process with the lowest process id. What is theaverage waiting time for the three processes? Describe in depth.
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…
Please do not give solution in image formate thanku Suppose that the following processes arrive for execution at the times indicated. Eachprocess will run for the amount of time listed. In answering the questions, use non-preemptive scheduling, and base all decisions on the information you have at the time thedecision must be made.Process Arrival time Burst TimeP1 0.0 10P2 0.5 5P3 1.0 2a) What is the average turnaround time for these processes with the FCFS schedulingalgorithm?b) What is the average turnaround time for these processes with the SJF schedulingalgorithm?c) The SJF algorithm is supposed to improve performance, but notice that we chose torun process P1 at time 0 because we did not know that two shorter processes wouldarrive soon. Compute what the average turnaround time will be if the CPU is left idlefor the first 1 unit and then SJF scheduling is used. Remember that processes P1 andP2 are waiting during this idle time, so their waiting time may increase. This…
To not let any process wait longer than 500 ms, a system developer programs the Round Robin procedure with a dynamic time quantum size. With ‘n’ processes ready, the time quantum Q is set to 500 ms/n. What do you think of this scheduling strategy? (In which situations is this strategy feasible, and when is it not? Are there edge cases?) Explain your reasoning.
A deadlock occurs when a group of processes is stalled because one process is holding a resource and waiting for another process to obtain it. Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can proceed. In operating systems, a similar scenario happens when two or more processes possess certain resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1. Give an example of a realistic deadlock avoidance approach and describe the basic strategy behind it.
Given the list of processes, their CPU burst times, arrival times and priorities implement SJF,Priority and Round Robin scheduling algorithms on the processes with preemption. For each ofthe scheduling policies, compute and print the completion Time(CT), Turnaround Time(TAT),and Waiting Time(WT) for each process using C Programming.Waiting time: Processes need to wait in the process queue before execution starts and inexecution while they get preempted. Turnaround time: Time elapsed by each process to get completely served. (Difference betweensubmission time and completion time).
We are dealing with 6 processes p1;p2; : : : ;p6:(a) Processes p1;p2 in p3 arrive at time 2 ms, respectively. Each of those processesneeds 5 ms of CPU time.(b) Process p4 arrives at time 10 ms and needs 3 ms of CPU time.(c) Processes p5 in p6 arrive at time 19 ms. Process p5 needs 7 ms, while process p6needs 4 ms of CPU time.Scheduling is preemptive, where there process switch takes 1 ms. For the Round-Robinalgorithms with quantum 2 ms illustrate the execution of those processes on a timeline.Then determine the average turnaround time.
(2)How many safe sequences are there for the above snapshot? Briefly justify your answer. (3)If P1 requests an additional instance of each of A and C, that is, P1's request becomes (2, 4, 6), will this request result in a deadlock? If the answer is no, give a safe sequence. If the answer is yes, identify the processes that will be involved in the deadlock. Show your work.
When this option is available, the I/O queue should be prioritised above the process execution queue. In what ways may this be beneficial? Who knows what will take place if there is a disruption in the I/O. It is unclear at this time if this will have an effect on the maximum burst rate of the CPU. I'm not really clear on the point you're trying to make here.
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 =