There are six processes in three priority classes. Class 1 has the highest priority. (The amount of CPU time needed by each process is written in brackets.) ● Class 1: II₁ (13 ms), II3 (8 ms), II6 (6 ms) Class 2: II₂ (10 ms), II5 (4 ms) Class 3: II4 (12 ms) The system is using the following algorithm: The scheduler picks a process from the highest (non-empty) class. To schedule processes within the same class, the Round-Robin algorithm is used with quantum 5 ms. Process switch takes 1 ms. (a) Draw the schedule for the above processes on a timeline. (b) Mirko decided to modify the above algorithm: After each burst (i.e. when the quantum experies) the process is degraded by one class (unless it is already in Class 3). Draw the schedule for Mirko's modified algorithm.

There are six processes in three priority classes. Class 1 has the highest priority. (The amount of CPU time needed by each process is written in brackets.) ● Class 1: II₁ (13 ms), II3 (8 ms), II6 (6 ms) Class 2: II₂ (10 ms), II5 (4 ms) Class 3: II4 (12 ms) The system is using the following algorithm: The scheduler picks a process from the highest (non-empty) class. To schedule processes within the same class, the Round-Robin algorithm is used with quantum 5 ms. Process switch takes 1 ms. (a) Draw the schedule for the above processes on a timeline. (b) Mirko decided to modify the above algorithm: After each burst (i.e. when the quantum experies) the process is degraded by one class (unless it is already in Class 3). Draw the schedule for Mirko's modified algorithm.

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

Related questions

Q: Referring to the digraph above, schedule the tasks on two processors using the decreasing-time-list…

Q: Assume the following transection T1 and T2 executing in serial schedule. The Initial value of A=20…

A: Answer: In serial schedule a process performs all transaction exclusively. After completing the all…

Q: Question 1 (Task Scheduling Suppose that we have n tasks to schedule on a computer with a…

A: Hello student Greetings In the context of task scheduling, the problem involves scheduling a set…

Q: In a setting that relies heavily on timesharing, which type of process scheduling is the most…

A: Process planning / activity is done to complete the task on time. CPU scheduling is a process that…

Q: For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround…

A: All the process arrive at same time in the sequence P1->P2->P3->P4. The time quantum time…

Q: In priority scheduling, support for real time processing is allowed All of the above The processes…

A: Answer: Priority scheduling is a non-preplanned calculation and one of the most widely recognized…

Q: Select the correct statement(s) from the following with regard to the type of schedule in OpenMP for…

A: The five different scheduling types: static,dynamic,guided,auto runtime.

Q: Can you explain the differences between scheduling for the short, the medium, and the long term?

A: Scheduling in the context of project management and resource allocation can be classified into three…

Q: In this, the process that comes first will be executed first and next process starts on after the…

A: Find the answer given as below :

Q: An operating system has 3 user processes running in a set, each requiring 2 units of resource R. The…

A: An operating system plays a crucial role in managing resources and processes within a computer…

Q: Critical Sections - Select all of the following statements that are true A critical section is a…

A: The above question is solved in step 2 :-

Q: Using a number of different queues, each with its own scheduling strategy, is how the Multilevel…

A: 6 scheduling techniques that help you use your day effectively Blocking time. A scheduling technique…

Question

There are six processes in three priority classes. Class 1 has the highest priority. (The
amount of CPU time needed by each process is written in brackets.)
• Class 1: II₁ (13 ms), II3 (8 ms), II6 (6 ms)
• Class 2: II₂ (10 ms), II5 (4 ms)
Class 3: II4 (12 ms)
The system is using the following algorithm: The scheduler picks a process from the
highest (non-empty) class. To schedule processes within the same class, the Round-Robin
algorithm is used with quantum 5 ms. Process switch takes 1 ms.
(a) Draw the schedule for the above processes on a timeline.
(b) Mirko decided to modify the above algorithm: After each burst (i.e. when the
quantum experies) the process is degraded by one class (unless it is already in
Class 3). Draw the schedule for Mirko's modified algorithm.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Round-robin scheduling:

Step 2: Answer A)

Step 3: Answer B)

Solution

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Real-time Scheduling: Choose all true assertions. Rate Monotonic (RM) scheduling divides time into equal parts and requires each process to seek a portion upon starting. RM schedules real-time systems with CPU utilization below 1. When CPU utilization is less than 1, Earliest Deadline First (EDF) may schedule a real-time system. A process is initiated every p time unit. RM scheduling prioritizes shorter processes. EDF scheduling prioritizes processes with the shortest time frame.
The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 0,S1 = 1 and S2 = 1. Process P0:while (true) { wait (S0); print '1';release(S1);release(S2);} Process P1:wait (S2);release (S0); Process P2:wait(S2);release(S0); How many times will process P0 print '1'?
Which method of scheduling processes is actually the most effective?
A single-CPU system has four processes, P1, P2, P3 and P4 in the ready queue. The execution times and I/O needs for these processes are given below. All times are in ms. (hint: when a process starts an IO operation, it is removed from the ready queue and put back at the end of the queue only when it completes its IO). Process P1: Arrives at 0ms, needs 23ms of CPU time. Performs I/O for 5ms after 10ms of its execution time, then another 5ms after 20ms of its execution time. Process P2: Arrives at 3ms, needs 12ms of CPU time. Performs I/O for 10ms after 5ms of its execution time. Process P3: Arrives at 1ms, needs 15ms of CPU time. Performs I/O for 1ms after 7ms of its execution time. Process P4: Arrives at 2ms, needs 8ms of CPU time. Performs I/O for 5ms after 4ms of its execution time. We assume that the CPU is idle if no one of these four processes is using it. Using Round Robin scheduling algorithm with a Time Quantum of 4ms and ignoring the context switch time, determine: a) The…
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Ý, and Z to three processes PO, P1, and P2. The table given below presents the current system state. There are 3 instances of type X, 2 instances of type Y and 2 instances of type Z still available. The system is currently in a safe state. Answer the following questions! Allocation Max X Y z X Y PO 0 1 8 4 3 (a) If PO requests 2 instances of Z during the P1 3 2 current state, can it be granted? Explain! (b) If P1 requests 2 instances of X during the P2 2 1 1 3 3 3 current state, can it be granted? Explain! CO
COURSE Operating System Only correct answer will be upvoted. Else downvoted.
Bounded waiting requires that \A bound must exist on the number of times that other processes are allowed to enter their critical sections a) true b) false
For Scheduled Job, we can preset a time or an action with this to run the scheduled job: Group of answer choices Job Trigger Timer Preset Schedule
Q3: Suppose there is a processing unit composed by CPU and I/O component. For a specific task, CPU takes 5 second to finish the execution and I/O takes 2 second to process. The communication time between CPU and I/O can be elimiate under this circumstance. Execution Time 7 second 5second 2 second CPU time I/O time If CPU time decreases by 25% per year for 3 years and I/O time decreases by 20% per year 1) How many times faster is this program after 3 years? 2) What percentage of new time is I/O? and what percentage of new time is CPU?