Consider the following set of processes, with arrival times and the length of the CPU burst time given in milliseconds. a. Draw a Gantt chart that illustrates the execution of these processes using the Shortest-Remaining Time First (SRTF) scheduling algorithm. b. Give the average waiting time of Shortest-Remaining Time First (SRTF) scheduling algorithm. Note: Preempted processes are added to the end of the ready queue. Process Arrival Time Burst Time 4 B 1 3 2 1 D 3 E 4 3

Consider the following set of processes, with arrival times and the length of the CPU burst time given in milliseconds. a. Draw a Gantt chart that illustrates the execution of these processes using the Shortest-Remaining Time First (SRTF) scheduling algorithm. b. Give the average waiting time of Shortest-Remaining Time First (SRTF) scheduling algorithm. Note: Preempted processes are added to the end of the ready queue. Process Arrival Time Burst Time 4 B 1 3 2 1 D 3 E 4 3

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

Question 6 sm.Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Finally, suppose the 3 processes in question 3b always terminate in the reverse order in which they are first admitted to the ready queue (you may ignore turnaround times). Briefly describe a scheduling policy that ensures this happens. Your description should clearly state the selection function and decision mode for the policy.
Given three processes (process id P0, P1, P2 respectively) with compute time bursts 6, 2, and 8 units. All processes are available at t=0. Consider the shortest-job-first scheduling algorithm and find the sequence in which the processes will be scheduled.
Question 24 Four processes arrive at the same time with their priorities, execution times and 1/0 times given in the table below. Process Priority Exec 1/0 Exec 1/0 4 4 3. 2 2 P2 6 3 P3 1 3. 4 1 P4 2 4 2 1 Assume that a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the process with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process. Draw the timeline for CPU- and I/0- bursts for these processes
Four processes arrive at the same time with their priorities, execution times and I/O times given in the table below. Assuming a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the process with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process, at each turn; a-)Draw the timeline for CPU- and I/O- bursts for these processes b-)Calculate average turn-around time
Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process P1 P2 Burst time 7 4 P3 5 The processes are assumed to have arrived in the order P1, P2, P3, all at time 0. a. Draw the Gantt chart and demonstrate the start and end time of each process that illustrates the execution of these processes using round robin scheduling (time quantum-4 milliseconds). b. Calculate the average waiting time and the average turnaround time of the three processes.
d) Multilevel Queue Scheduling with Feedback Q3) Consider three CPU-intensive processes, which require 20, 10 and 3 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. (Explain your answer)
Suppose that an operating system supports two kinds of sequential processes: high-priority interactive processes, and low-priority non-interactive processes. The behavior of the high-priority processes is to alternate between periods of computation of duration Tc and periods of blocking (waiting for input) of duration Tb. The behavior of the low-priority processes is to compute constantly, with no blocking. The operating system’s scheduling policy is round-robin with a quantum q, where Tc < q. Scheduling decisions are made only when a quantum expires, or when the running process blocks. The scheduler selects a low-priority process to run only if no high-priority processes are ready. Suppose there is one high-priority process and one low-priority process in the system, and that both processes will run for a long time. For what fraction of the time does the low-priority process run?
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1 1 3 P2 3 1 P3 2 5 P4 4 4 P5 5 2 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw 2 Gantt charts that illustrate the execution of these processes using the following 2 scheduling algorithms: non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1). What is the turnaround time of each process for each of the scheduling algorithms in part a? Explain why What is the waiting time of each process for each of these scheduling algorithms?Explain why
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds, Process CPU Burst Time P1 P2 1 P3 P4 1 P5 7 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw four Gantt charts illustrating the (i) execution of these processes using SJF and RR (quantum = 1) scheduling. (ii) What is the waiting time of each process for each of the scheduling algorithms in part (i)? %3D
For Question, put your answer in the following blanks. Note: You must put answer only, no need to put the unit. One answer per blank.
Fill in blank Suppose that there is only one CPU and we have three processes P1, P2, P3 arrived for execution at time 0, 1, 2 respectively. Their burst time are 8, 5, 2 respectively. None of these processes will perform I/O operations. Consider non-preemptive scheduling. With the FCFS scheduling algorithm, the average turnaround time of these processes will be----- and the average response time will be ------ With the SJF scheduling algorithm, the average turnaround time of these processes will be ----- and the average response time will be -----