Part IAssume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. TheCPU execution times for these processes are as follows:Process Execution TimeP1P2P3P4138156Draw the Gantt chart and calculate the metric listed in parentheses for each of the following schedulingalgorithms:1. First Come, First Served (Total Wait Time)2. Shortest Job First (Total Wait Time)3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times)Part IINow assume that P1 arrives in the ready queue at time 0, P2 arrives at time 4, P3 arrives at time 10, and P4arrives at time 20. The CPU execution times for the processes are the same as in Part I:Process Execution TimeP1P2P3P4P113P28P315P46Draw the Gantt chart and calculate the total wait time for each of the following scheduling algorithms:1. Shortest Job First2. Shortest Remaining Time Next (remember, this is a preemptive algorithm)3. Preemptive priority with the following priorities:Process Priority3412For this system, assume that the highest priority has the lowest number (i.e., 1 is the most important)4. Non-Preemptive priority with the same priorities as above. Be sure to note priority inversion when/if itoccurs. Priority inversion is when a process with a lower priority executes over a process with a higherpriority.

The CPU scheduling algorithm is used to decide which processes will be allocated to the CPU. The…

Part I Assume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 P2 P3 P4 13 8 15 6 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times)

Part I Assume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 P2 P3 P4 13 8 15 6 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times)

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

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.
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?
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.
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. Explain the advantages and disadvantages of this scheduling policy. Identify the user group that would find this most advantageous. Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. What are the parameters that affect the efficiency of the round robin?
Direction: Draw a Gantt chart showing the execution of CPU for the following processes implementing Round robin (RR) as indicated below. Also, compute the turnaround times (TAT) and waiting times (WT) of all processes using this scheduling algorithm. The quantum time (QT) is set to 6. Question 1 10 pts Write your answers on the spaces provided. Process Burst Time (BT) Arrival time (AT) RR TAT RR WT P1 15 P2 10 5 P3 P4 3 10 P5 5 20
b. Upon creation, 3 processes (A, B and C) are admitted into the ready queue in quick i.e., one immediately after another. You notice the processes always successfully terminate in the order A, B, C-and the average turnaround time is always the same - irrespective of the order in which the processes are first admitted into the ready queue. The processes make no 10 requests and have different service times. succession 1. What scheduling policy could the OS be employing? Explain why you think this. Name 3 scheduling policies that are not employed by the OS. Explain why you II. think this for each policy you mention.
Let the processes P1, P2, P3, P4, and P5 be given. They arrive in the system at the same time in this order. The processes have the attached file as service times (in time units) and priorities. For each of the scheduling methods (First Come, first served (FIFO), Shortest Job First, Round Robin, and Priority Scheduling), specify the execution order of the processes and the average execution time (average turnaround time) for all processes. First, determine and state the execution times of the individual processes and then calculate the average value. Note: • For Shortest Job First, If the required service time (CPU time) is the same for two or more processes, use First Come, first served to resolve the conflict. • For Round Robin, the time quantum q = one time unit. • For Priority Scheduling, low integer priority values signify high priorities, with O being the highest possible priority. If multiple processes have the same priority, use First Come, first served to resolve the conflict.…
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 that the following processes arrive for execution at the time given below. Each process will run for the amount of time listed. Calculate average turnaround and average waiting time for these processes under Shortest remaining time first (SRTF)(preemptive) scheduling AlgorithmHints: turnaround time: The interval from the time of arrival of a process to the time of completionWaiting time: The sum of the periods spent waiting by a process in the ready queue
Assignment Scheduling Given the following processes. Process Burst Time P1 17 P2 P3 12 Using Round Robin (RR) scheduling with time quantum q=4, Draw the Gantt chart for the RR scheduling. ABC
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. Identify the user group that would find this most advantageous. Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. What are the parameters that affect the efficiency of the round robin?
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