Q3 Consider the following set of processes, with the length of the Arrival time and the CPU burst time given in milliseconds: a) Draw the Gantt chart that illustrates the execution of these processes using Preemptive-SJF scheduling algorithm. b) What are the turnaround time of each process and the average turnaround time? c) What are the waiting time of each process and the average waiting time? Process Arrival Time Burst Time P, 6 P2 2 5 P3 3 7 P. 6 4 Ps 7 2 1, Add file

Q3 Consider the following set of processes, with the length of the Arrival time and the CPU burst time given in milliseconds: a) Draw the Gantt chart that illustrates the execution of these processes using Preemptive-SJF scheduling algorithm. b) What are the turnaround time of each process and the average turnaround time? c) What are the waiting time of each process and the average waiting time? Process Arrival Time Burst Time P, 6 P2 2 5 P3 3 7 P. 6 4 Ps 7 2 1, Add file

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

The following processes arrive at time 0 with the given CPU-burst times as shown in table below. Process Burst Time (ms) P1 10 P2 1 P3 7 P4 2 P5 5 Using Round Robin (RR) scheduling algorithm with a time slice of 2 ms, do the following: Draw the Grantt chart of the scheduling. Calculate the waiting time and Turnaround time for each process. Calculate the average waiting time and average turnaround time.
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm. c.…
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm.…
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…
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)
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 "Shortest Job First" (SJF), specify the execution order of the processes, the average execution time (average turnaround time) and the average waiting time over all processes. You must show your calculations. You will not have to draw Gantt charts.
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm. b.…
Consider the following set of processes, with the length of the CPU burst given in seconds: NOTE: The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. A bash script program that illustrate the execution of these processes using the following scheduling algorithms: preemptive priority (a larger priority number implies a higher priority), and Round Robin (quantum = 8). b. What is the turnaround time of each process for each of the scheduling algorithms in part a? c. What is the Response time of each process for each of these scheduling algorithms? d. Consideration of context switch time i.e. 2 secs is also required.
Assume that the following processes are the only processes in a computer system and that there are no input/output requests from all the given processes. Given the following arrival time and CPU burst time (also called service time) for each process, answer the following questions. Draw the Gantt chart and compute the average waiting time for the following CPU scheduling algorithms of picture First Come First Service (FCFS)? Preemptive Shortest Job first? Round-Robin with time quantum of 4 (Assume that new processes will be inserted at the end of the ready list ?
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…
Question no 02: 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)?
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).