12. Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. Find the average turn around time.

12. Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. Find the average turn around 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

Consider the following set of processes. Process BurstTime Priority Arrival P1 30 20 0 P2 5 25 5 P3 15 20 12 P4 10 30 48 Assume that the CPU is idle at time 0 and that processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. a.What is the turnaround time for P3? Give your answer as an integer. b. What is the waiting time for P1? Give your answer as an integer. c. Indicate whether the processes run concurrently. 1P1 and P3 2P2 and P3 3P4 and P3 d. How many times does a context switch from P1 occur? Give your answer as an integer.
Consider the following processes:Process Arrival Time Service Time A 0 4 B 1 3 C 2 3 D 2 2 E 3 1 F 5 3 Show (draw the schedule, x-axis is time, and one row for each CPU) how the aboveprocesses execute over time on a system with 2 CPUs. Compute the average turnaroundtime for all processes and the average utilization for each CPU under each of the following schedulers: (a) FCFS with a single Ready Queue. A process gets scheduled once one of the CPUsis available. When both CPUs are available, we select CPU1. (b) FCFS with a Ready Queue per CPU. Processes A, B, and C go to CPU1 and processesD, E, and F go to CPU2. (c) HRRN with a single Ready Queue. A process gets scheduled once one of the CPUsis available. When both CPUs are available, we select CPU1.
Consider the following set of six processes, with the arrival times, CPU burst time (in milliseconds), and priority. process arrival time burst time priority P1 22 10 3 P2 8 4 2 P3 28 12 6 P4 10 8 1 P5 35 6 5 P6 8 20 4 (a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, preemptive priority (a smaller priority number implies a higher priority), and RR (quantum= 8).(b) Compute the average wait time in each of the scheduling algorithms in part (a)?
1. Consider the following set of processes, with the length of the CPU burst given inmilliseconds: Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.a. Draw four Gantt charts that illustrate the execution of these processes using thefollowing scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger prioritynumber implies a higher priority), and RR (quantum = 2).b. What is the turnaround time of each process for each of the scheduling algorithms inpart a?c. What is the waiting time of each process for each of these scheduling algorithms?d. Which of the algorithms results in the minimum average waiting time (over allprocesses)?
Consider the following set of processes, with the length of the CPU burst given in milliseconds Process Burst Time Priority P1 5 1 P2 2 3 P3 1 3 P4 1 2 P5 10 4 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, and RR (quantum = 3). What is the turnaround time of each process for each of the scheduling algorithms in part a? what is the waiting time of each process for each of the scheduling algorithms in part a? Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst time Arrival time P1 10 1 P2 04 2 P3 05 3 P4 03 4 Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF preemptive and Round Robin (quantum = 3). What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)? Which of the algorithms results in the minimum average turnaround time (over all processes)?
Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst Priority P1 32 4 P2 24 1 P3 4 2 P4 36 2 P5 12 3 NOTE: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and Round Robin (quantum = 8). What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)? Which of the algorithms results in the minimum average turnaround time (over all processes)? NOTE: Write the code of all parts
Consider the following set of processes, the length of the CPU burst time given in milliseconds: Process Burst Time P1 6 P2 8 P2 7 P4 3 Assuming the above processes are being scheduled with the Shortest Job First (SJF) scheduling algorithm. The waiting time for process P1 is 3ms The waiting time for process P1 is 0ms The waiting time for process P1 is 16ms The waiting time for process P1 is 9ms From the following list which is the deadlock avoidance algorithm? Banker’s algorithm Round-robin algorithm Elevator algorithm Karn’s algorithm A problem encountered in multitasking when a process is perpetually denied necessary resources is called Deadlock Starvation Inversion Aging To break a deadlock: Abort one or more processes to break the circular wait Abort all the process in the system Preempt all resources from all processes None of the mentioned Termination of the process terminates First thread of the process First two threads…
2. Consider the following processes with their associated CPU burst times. The processes have entered the system in the order that they are presented in the table. Process : BurstTime P1 : 7 P2 : 1 P3 : 13 P4 : 4 P5 : 5 For each of the following scheduling algorithms, draw a Gantt chart that illustrates the order of execution for each of these processes. Also, compute the average waiting time for each algorithm. a. First Come First Served b. Shortest Job First c. Round Robin (with time quantum of 3)
Consider the following set of processes that arrive at time = 0, with the length of the CPU - burst time given in milliseconds and time quantum = 4: 1)Draw the Time chart illustrating the execution of the process using Round Robin scheduling and non preemptive priority scheduling. 2) Find the average waiting time.
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 P4 4 2 P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). What is the turnaround
Consider the FCFS, SJF, and RR (quantum = 8 milliseconds) scheduling algorithms for this set of processes. Process Burst Time P1 8 P2 25 P3 3 P4 7 P5 11 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a) Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, and RR. b) What is the waiting time of each process for each of these scheduling algorithms? c) Which of the algorithms results in the minimum average waiting time (overall processes)? d) Derive the Need (max-Alloc) matrix. It should be presented like the Allocation or Maximum matrices above. e) If the request from process P1 arrives for (0,1,2,0), can the request be granted? Why?