Question 1:Consider below table of five processes with Priority, Burst and Arrival time, Draw the Gantt chart and Findthe Waiting Time, Average waiting time, Turnaround Time, Average Turnaround Time usinga) FIFO Scheduling by considering Arrival Timeb) Non Preemptive SJFc) Preemptive SJF Schedulingd) Non Preemptive Priority Scheduling with Largest Number is having the Highest Priority.(For processes with the same priority FCFS will be chosen)e) Preemptive Priority Scheduling with Largest Number is having the Highest Priority(For processes with the same priority FCFS will be chosen)f) Round Robin Scheduling with Quantum = 5msProcessP1P2P3P4P5P6Priority834455Burst15202020515Arrival0020254555

Answered: Image /qna-images/answer/d1377f78-6b45-499d-96ba-06f3da526b97.jpg

Consider below table of five processes with Priority, Burst and Arrival time, Draw the Gantt chart and Find the Waiting Time, Average waiting time, Turnaround Time, Average Turnaround Time using a) FIFO Scheduling by considering Arrival Time b) Non Preemptive SJF

Consider below table of five processes with Priority, Burst and Arrival time, Draw the Gantt chart and Find the Waiting Time, Average waiting time, Turnaround Time, Average Turnaround Time using a) FIFO Scheduling by considering Arrival Time b) Non Preemptive SJF

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

rocess Arrival Time CPU Burst Time Priority PI P2 P3 P4 5 0 7 4 6 7 5 7 HIGH LOW VERY HIGH MEDIUM (a) Draw a Gantt chart of the process scheduling using preemptive, priority-based scheduling. Determine the waiting time & the turnaround time of individual processes and the average waiting time & the average turnaround time. In case of a tie, use arrival times to break the tie
Process Burst Time Priority P1 6 3 P2 1 P3 P4 4 P5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time e. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, non- preemptive SJF, non-preemptive priority (a larger priority number implies a higher priority)and RR (quantum = 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part 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 all processes 2. 2. 5. 4)
You are designing a real-time system that must execute the following set of processes: P1(20,3); P2(5,2); P3(350,15); P4(500,22); P5(100,10) Note: The first parameter listed for each process is the period, and the second is the maximum execution time. Can these processes be scheduled using Rate Monotonic? You must justify your answer. Can these processes be scheduled using Earliest Deadline First? You must justify your answer. If possible, identify the simplest of these strategies that can be used to schedule these processes.
Explain the impact of "changing time quantum" on process execution by defining the term Time Quantum in Round-Robin scheduling.
Q)Two processes P1, and P2 arrive at time=0 in order and have Process(execution time) as follows. P1(4), P2(2). Find the average waiting time for these processes if they are scheduled as Round Robin with time quanta of 1 unit. a)2 b)1 c)3 d)4 Q)Three processes P1, P2 and P3 arrive at time=0 in order and have Process(execution time) as follows. P1(10), P2(4), P3(7). Find the average response time for these processes if they are scheduled as Shortest Job First. a)12 b)3.3 c)5 d)4 Q)A process has executed 3 ms in its last burst and our estimate of its last burst was 6 ms. Find our estimate for its next burst with a)4 ms b)4.5 ms c)3.5 ms d)5 ms
Consider the following five processes each having its own unique execution time and arrival time Process Arrival Time Execution Time A 0 6 B 3 2 C 5 4 D 7 6 E 10 3 Draw a timeline and compute the average turnaround time and average waiting time for reach of the scheduling algorithms below: 1.FCFS 2.Round Robin (time slice = 3) 3. SRT 4. SJF
Shortest Process First (SPF) scheduling in a multiprocessing system is unrealistic because (select the correct choice): O Processes may stop execution before their allowed time expires. O Total process execution times are not known in advance. O Process /O requirements are not predictable. O Process execution burst durations are not known in advance. O Process time slices may end before execution times are completed.
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 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. Also,…
Consider the following set of tasks in a real-time system: 10. Consider the following set of tasks in a real-time system: Tasks Release time Execution time Absolute deadline T 1 7 40 T 2 4 9 30 T 3 7 40 T 4 9 10 30 Perform EDF scheduling on this task set.
Consider the following set of processes: Process Arrival Burs P1 00 7 P2 2 4 P3 4 Р4 Draw two Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, preemptive SJF. Find the average waiting time for FCFS only.
Consider the following job table with 6 jobs with job completion requirement. Assume a real-time system using EDF (Earliest Deadline First) processor scheduling. Jobs A B C D E F Deadline 4 1 40 2 17 16 Draw a diagram showing the list of jobs in the order of execution with start time and finish time of each job specified. Identify the jobs that fail to meet their deadline. Further, fill in the following table with start times and finish times of each job. Jobs A C D Arrival Time 0 0 1 1 3 6 E F Paragraph Start Time 00 Run (CPU) Time 3 1 B I 6 2 7 5 Finish Time U✓ A 44 FO +M
Do the Round Robin:Quantom=3 scheduling algorithm to the list of processes. The process should provide : a. A detailed gantt chart b. finish time, turnaround time, waiting time c. The average turnaround time d. The average waiting time