3. The following processes are being scheduled using a pre-emptive SJF scheduling algorithm. Process Arrival Burst Time Time P1 20 P2 25 25 P3 30 25 Р4 60 15 P5 100 10 P6 105 10 Draw Gantt chart illustrating the execution of these processes. What is the total execution time, average waiting time and average turnaround а. b. time? ·

3. The following processes are being scheduled using a pre-emptive SJF scheduling algorithm. Process Arrival Burst Time Time P1 20 P2 25 25 P3 30 25 Р4 60 15 P5 100 10 P6 105 10 Draw Gantt chart illustrating the execution of these processes. What is the total execution time, average waiting time and average turnaround а. b. time? ·

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

Assignment Scheduling Given the following processes. Process Burst Time P1 17 P2 5 P3 12 Using Round Robin (RR) scheduling with time quantum q=4, What is the average waiting time?
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 non-preemptive scheduling, and base alldecisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P1 0.0 9 P2 0.4 6 P3 0.6 4 P4 1.0 2 What is the average turnaround time for these processes with the FCFS scheduling algorithm? What is the average turnaround time for these processes with the SJF scheduling algorithm? The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not know that three 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, P2, P3 are waiting during this idle time, so their waiting time may increase.
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 non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P1 0.0 9 P2 0.4 6. P3 0.6 4 P4 1.0 2 What is the average turnaround time for these processes with the FCFS scheduling algorithm? What is the average turnaround time for these processes with the SJF scheduling algorithm? The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not know that three 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, P2, P3 are waiting during this idle time, so their waiting time may increase.
Assignment Scheduling Given the following processes. Process Burst Time P1 17 P2 5 P3 12 Using Round Robin (RR) scheduling with time quantum q=4, What is the average turnaround time?
Suppose there are five processes, their arrival time and running time are listed as follows. Adopt FCFS and SJF, respectively, give the schedule order and average waiting time. Give the schedule order of SJF. Compute the average waiting time of SJF. Process Arrival time Running time P1 P2 P3 P4 0 3 4 5 3 10 6 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 non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P1 0.0 P2 0.4 P3 0.6 4 P4 1.0 2 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 performanee, but notice that we chose to run process P1 at time 0 because we did not know that three 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, P2, P3 are waiting during this idle time, so their waiting time may increase.
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 non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P1 0.0 P2 0.4 P3 0.6 4 P4 1.0 a) What is the average turnaround time for these processes with the FCFSS 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 know that three 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, P2, P3 are waiting during this idle time, so their waiting time may increase.
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.
Suppose that there are 12 resources available to three processes. At time 0, the following data is collected. The table indicates the process, the maximum number of resources needed by the process, and the number of resources currently owned by each process. Is the state safe, not safe? Pls. explain your answer. Process Maximum Needs Currently Owned Po 10 4 P1 3 P2 7 4 2.
Consider there are two set of processes Set1 has processes with longer burst times than Set2. The operating system is implementing Shortest Job First (SJF) for Scheduling. Which SJF approach is suitable for Set1 and Set2 (choose from Preemptive and Non-Preemptive). Justify your answer.
In the event of an impasse, it becomes necessary to terminate said processes, thereby leading to the subsequent consequences:
Which one of the following statements about waiting times of processes is FALSE? The average waiting time for a given set of processes with Shortest-Job-First scheduling (without preemption) depends on the order in which the processes arrived in the queue. None of the mentioned Multi-level Queue Scheduling is most suitable when processes have diverse needs in terms of CPU and I/O bursts The average waiting time for a given set of processes with Priority scheduling (without preemption) does not depend on the order in which the processes arrived in the queue. The average waiting time for a given set of processes with First-Come-First-Served scheduling (without preemption) depends on the order in which the processes arrived in the queue.