Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1 2 2 P2 P3 4 P4 3 2 P5 4 3 The processes are assumed to have arrived in the order P1 , P2 , P3 , P4 , P5 , all at time o. a) 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 = 3). 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 im part a?

Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1 2 2 P2 P3 4 P4 3 2 P5 4 3 The processes are assumed to have arrived in the order P1 , P2 , P3 , P4 , P5 , all at time o. a) 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 = 3). 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 im part a?

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

Transcribed Image Text Consider the following set of processes, with arrival times and the length of the CPU burst time given in milliseconds. a. Draw a Gantt chart that illustrates the execution of these processes using the Shortest-Remaining Time First (SRTF) scheduling algorithm. b. Give the average waiting time of Shortest-Remaining Time First (SRTF) scheduling algorithm. Note: Preempted processes are added to the end of the ready queue. Process Arrival Time Burst Time A 4 B 1 3 1 D 3 4 3
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)
Asap
Part I Assume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 P2 P3 P4 13 8 15 6 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times) Part II Now assume that P1 arrives in the ready queue at time 0, P2 arrives at time 4, P3 arrives at time 10, and P4 arrives at time 20. The CPU execution times for the processes are the same as in Part I: Process Execution Time P1 P2 P3 P4 P1 13 P2 8 P3 15 P4 6 Draw the Gantt chart and calculate the total wait time for each of the following scheduling algorithms: 1. Shortest Job First 2. Shortest Remaining Time Next (remember, this is a preemptive algorithm) 3. Preemptive priority with the…
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?
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process P1 P2 P3 P4 P5 Burst Time 5 3 1 7 4 Priority 4 1 2 2 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. 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?
Three periodic processes of an operating system has P(burst time, period) as follows: P1(4,20), P2(6,10), P3(12,30). Which of the following is true when these processes are scheduled with Rate-Monotonic scheduling algorithm that assigns priorities proportional to periods (shorter period has higher priority). a)No process misses a deadline b)Only P3 misses its deadline c)P1, P2 and P3 all miss their deadlines d)P2 and P3 both miss their deadlines