Consider the following process scheduling scenario:Process name Arrival time Processing timeABCDa. Round-Robin (RR) (quantum time, q = 3)ABCD0256Show (use shading) the execution pattern for one cycle for each process using thefollowing scheduling policies:D6413ABсPriority231 (highest)4 (lowest)01 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20b. Preemptive SJF (Shortest Job First) / Shortest Remaining Time (SRT)01 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20c. From the answers produced in 3(a) and 3(b), calculate the average waiting time andspecify the best algorithm for the given scenario. Explain the reason /justification thealgorithm is selected as the best.

The working hand calculation and respective explanation are provided in the photos attached below.

Consider the following process scheduling scenario: Process name Arrival time Processing time 6 4 1 3 A B A B C D C D 0 2 a. Round-Robin (RR) (quantum time, q = 3) 5 6 Show (use shading) the execution pattern for one cycle for each process using the following scheduling policies: A B C D Priority 2 3 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 (highest) 4 (lowest) b. Preemptive SJF (Shortest Job First) / Shortest Remaining Time (SRT) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 c. From the answers produced in 3(a) and 3(b), calculate the average waiting time and specify the best algorithm for the given scenario. Explain the reason /justification the algorithm is selected as the best.

Consider the following process scheduling scenario: Process name Arrival time Processing time 6 4 1 3 A B A B C D C D 0 2 a. Round-Robin (RR) (quantum time, q = 3) 5 6 Show (use shading) the execution pattern for one cycle for each process using the following scheduling policies: A B C D Priority 2 3 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 (highest) 4 (lowest) b. Preemptive SJF (Shortest Job First) / Shortest Remaining Time (SRT) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 c. From the answers produced in 3(a) and 3(b), calculate the average waiting time and specify the best algorithm for the given scenario. Explain the reason /justification the algorithm is selected as the best.

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

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)
Problem 4 There are two approaches for scheduling tasks on multiprocessor platform: the partitioned approach and the global approach. The table below shows Ci (WCET) and Ti (period) for six periodic tasks to be scheduled on m = 3 processors. The relative deadline of each periodic task is equal to its period. T T1 10 T2 10 25 T3 12 30 T4 10 T5 8. 20 T6 7 100 The task set is schedulable using rate-monotonic partitioned scheduling algorithm. Show how the task set is partitioned on m = 3 processors so that all the deadlines are met?
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.
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
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
1. Consider the following task set scheduled according to the rate monotonic assignment and answer the questions accordingly. T1-(1, 0.5), T2= (1.5, 0.4) (a) Is the schedule feasible? (b) Do these tasks fully utilize the processor (based on RM scheduling)? Show your answer. (c) (if the answer to (b) is “no",) Change the run time of the first task so that the resulting set will maximize the utilization of the processor under RM scheduling. (d) What is the maximum achievable utilization if the period for the second task was changed from 1.5 to 2 (and the run times could also be modified to achieve maximum utilization)?
Consider the following processes:Process Arrival Time Service Time A 0 3 B 1 1 C 3 3 D 4 2 E 5 5 Show how the above processes execute over time on a single CPU system (i.e., please drawthe schedule where the x-axis is the time). Compute the completion time for each process,and the average turnaround time for all processes under each of the following schedulers:(a) FCFS. (b) Round Robin with (q = 1). (c) Shortest Job First. (d) Shortest Remaining Time First. (e) HRRN.
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 set of processes (a smaller priority number implies a higher priority). The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Process Priority Burst Time P1 1 20 P2 3 25 P3 4 25 P4 2 15 P5 5 30 What is the waiting time of each process for each of the scheduling algorithms FCFS, SJF (if two jobs have the same burst time, schedule them following priority), non-preemptive priority? Process FCFS SJF Priority P1 P2 P3 P4 P5
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.