Problem 05 : 1)There are 5 different processes executing in the system. The process name , burst time and arrival time are given in the below table. Draw Gnatt chart and calculate the average waiting Time using pre-emptive scheduling of SJRTF. Process Name Burst Time ( ms) Arrival Time ( ms ) P1 2 P2 5 1 P3 10 2 P4 7 P5 3 4 2) Write a python program to read n process with burst times. Calculate the average waiting time for all 'n' process using FCFS scheduling algorithm. Assume n = 4 Process Burst Time ( ms) P1 2 P2 5 P3 10 P4 7

Problem 05 : 1)There are 5 different processes executing in the system. The process name , burst time and arrival time are given in the below table. Draw Gnatt chart and calculate the average waiting Time using pre-emptive scheduling of SJRTF. Process Name Burst Time ( ms) Arrival Time ( ms ) P1 2 P2 5 1 P3 10 2 P4 7 P5 3 4 2) Write a python program to read n process with burst times. Calculate the average waiting time for all 'n' process using FCFS scheduling algorithm. Assume n = 4 Process Burst Time ( ms) P1 2 P2 5 P3 10 P4 7

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

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 Service time (CPU burst) exe P1 53 und P2 17 P3 68 P4 all 24 ur ca ulations. TOU arts. 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).
Given below are the arrival and burst times of four processes P1, P2, P3 and P4. Using SJF preemptive and RR scheduling (Quantum = 5ms, no priority based preemption). PROCESS NO Arrival time (msec) Burst time(msec) P1 2 7 P2 3 3 P3 4 5 Р4 6 Write a program to calculate the average waiting time, average turnaround time, average response time, throughput, and CPU utilization. For what percentage of does the CPU remain idle?
1)There are 5 different processes executing in the system. The process name , burst time and arrival time are given in the below table. Draw Gnatt chart and calculate the average waiting Time using pre-emptive scheduling of SJRTF . Process Name Burst Time ( ms) Arrival Time ( ms ) PO P1 10 1 P2 12 P3 4 Р4 4 4 2) Write a python program to read n process with burst times. Calculate the average waiting time for all 'n' process using FCFS scheduling algorithm. Assume n = 4 Process Burst Time ( ms) РО P1 10 P2 12 P3 4
NOTE: "Exekveringstid(ms)" means execution time or burst time in milliseconds Assume that a system with a CPU at one time has the following processes queued in the CPU's READY queue: Calculate the waiting time for the seven processes: 1) If FCFS is being used 2) If LRU is being used 3) If RR with time quantum of 8ms
1.Draw Gantt chart and calculate the average waiting Time using preemptive scheduling for SJRF. Process Name Burst Time ( ms) Arrival Time ( ms P1 15 1 P2 5 2 P3 4 3 P4 10 4 5 P5 8 Assume all the process arrive at the same time. Calculate the average waiting Time using Non preemptive scheduling for FCFS. Write a program in PYTHON to implement the given CPU scheduling algorithm Process Name Burst Time ( ms) Arrival Time ( ms ) PI 15 1 P2 5 P3 4 3 P4 10 4 P5 8 5
2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 ii) Is it likely that any processes will suffer starvation?
Problem 03 : 1)There are 5 different processes executing in the system. The process name , burst time and arrival time are given in the below table. Draw Gnatt chart and calculate the average waiting Time using pre-emptive scheduling of SJRTF. Process Name Burst Time ( ms) Arrival Time ( ms ) P11 4 P12 5 1 P13 10 P14 3 3 P15 8 4 2) Write a python program to read n process with burst times. Calculate the average waiting time for all 'n' process using FCFS scheduling algorithm. Assume n =4 Process Burst Time ( ms) P11 4 P12 5 P13 10 P14 3
Suppose we have three processes P0, P1, and P2. Process P0 executes statement S0 and process P1 executes statement S1 and process P2 executes statement S2. Use wait and signal to ensure the following: S2 is always executed before S1 and S1 is always executed before S0S0.
57. If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are a. Non conflict equivalent b. Equal c. Conflict equivalent d. Isolation equivalent
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).
Problem 02 : 1)There are 5 different processes executing in the system. The process name , burst time and arrival time are given in the below table. Draw Gnatt chart and calculate the average waiting Time using pre-emptive scheduling of SJRTF . Process Name Burst Time ( ms) Arrival Time ( ms ) PO 5 P1 10 1 P2 12 2 P3 4 3 Р4 4 4 2) Write a python program to read n process with burst times. Calculate the average waiting time for all 'n' process using FCFS scheduling algorithm. Assume n = 4 Process Burst Time ( ms) PO P1 10 P2 12 P3 4
CPU scheduler will decide which process should be given the CPU for its execution. For this it uses different algorithm to choose among the process. One among that algorithm is FCFS algorithm. In this algorithm the process which arrives first is given the CPU after finishing its request only it will allow the CPU to execute another process. Write a c program to implement the first come first serve CPU scheduling algorithm Sample output: Enter number of processes:3 Enter the burst times: Gantt chartPi 92 P3 Process Burst Time Waiting Time Turnaround Time 8 5 P1 P2 P3 0 13 Average Waiting Time is 7.000000 Average Turn around Time is 14.333333 8 22