Q// Assume that we have the workload shown below. All five processes arrive at time 0, in theorder given, with the length of the CPU burst given in milliseconds:Process CPU Burst Time PriorityP110P229P33P4P5121A) Consider the FCFS, SJF, and RR (quantum = 10 milliseconds) scheduling algorithms forthis set of processes. Which algorithm would give the minimum average waiting timeand minimum average turnaround time?B) Using the Priority algorithm, find the average waiting time and average turnaroundtime.C) If the CPU was idled for 2 milliseconds and the future knowledge algorithm was used,did that enhance the average waiting time and average turnaround time for thisworkload?D) Suppose that a multilevel feedback queuing is used such that Q1 is RR with (quantum =5 milliseconds) and the process's entrances to Q1 is done according to their priorities.Q2 is fixed time SJF queue which specifies 4 milliseconds for each process. Q3 is FCFSqueue. Find the average waiting time and average turnaround time.E) Suppose that a multilevel queuing is used which consists of 3 queues Q1, Q2, and Q3.Q1 is RR with (quantum = 10 milliseconds) and specified for the processes of prioritiesranged from [0, 1]. Q2 is SJF which specified for the processes of priorities ranged from[2,3]. Q3 is FCFS which specified for the processes of priorities ranged from [4 andabove]. Find the average waiting time and average turnaround time.

Answered: Image /qna-images/answer/70a97bfb-3219-4c9f-aa10-16580ca3bbf4.jpg

Q// Assume that we have the workload shown below. All five processes arrive at time 0, in the order given, with the length of the CPU burst given in milliseconds: Process CPU Burst Time Priority P1 10 P2 29 P3 3 4 P4 7 3 P5 12 1 A) Consider the FCFS, SJF, and RR (quantum = 10 milliseconds) scheduling algorithms for this set of processes. Which algorithm would give the minimum average waiting time and minimum average turnaround time? B) Using the Priority algorithm, find the average waiting time and average turnaround time. C) If the CPU was idled for 2 milliseconds and the future knowledge algorithm was used, did that enhance the average waiting time and average turnaround time for this workload?

Q// Assume that we have the workload shown below. All five processes arrive at time 0, in the order given, with the length of the CPU burst given in milliseconds: Process CPU Burst Time Priority P1 10 P2 29 P3 3 4 P4 7 3 P5 12 1 A) Consider the FCFS, SJF, and RR (quantum = 10 milliseconds) scheduling algorithms for this set of processes. Which algorithm would give the minimum average waiting time and minimum average turnaround time? B) Using the Priority algorithm, find the average waiting time and average turnaround time. C) If the CPU was idled for 2 milliseconds and the future knowledge algorithm was used, did that enhance the average waiting time and average turnaround time for this workload?

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Consider the following four processes with the length of CPU burst time in milliseconds. Calculate…

A: BELOW ? STEP BY STEP COMPLETE SOLUTION REGARDING YOUR PROBLEM WITH EXPLANATIONS .

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: 1. Consider a system of 9 processes, P = {p1, ..., p9}. Associated with the system are 6 memory…

A: As per our policy, we are allowed to answer one question at a time. If want an answer or some other…

Q: Consider the following set of processes, with the length of the CPU burst time given in…

A: Non-Preemptive SchedulingThe processes are scheduled as per their burst time with the least…

Q: Let S = {P1, P2 P3 P4} be the set of processes %3D arriving at time 0 and the length of CPU burst…

A: Given process p1 p2 p3 p4 with CPU burst times of 5 7 6 4 respectively

Q: Can you help with this problem of bounded buffer shared memory. There are two processes who share a…

A: 1) A bounded buffer shared memory, also known simply as a bounded buffer or a bounded queue, is a…

Q: Consider the following set of six processes, with the arrival times, CPU burst time (in…

A: Consider the following set of six processes, with the arrival times, CPU burst time (in…

Q: n processes are time-sharing the CPU. The average total CPU time is T. The time quantum is Q. The…

A: We’ll answer the first three subparts of the question since the exact one wasn’t specified. Please…

Q: Suppose that there is only one CPU and we have five processes P1, P2, P3, P4, P5 all arrived at time…

A: We are given 5 processes which are scheduled based on priority scheduling algorithm. And priority is…

Q: lustrate the behaviour of the Best Fit memory allocation algorithm for the following set of…

A: Here is the explanation of the above problem. See below steps.

Q: Consider the following set of processes, with the length of the CPU burst given in milliseconds.…

A: CPU scheduling:- CPU scheduling is a key aspect of operating systems that deals with the management…

Q: Suppose that an operating system supports two kinds of sequential processes: high-priority…

A: Introduction of Operating System: An operating system (OS) is a collection of software that manages…

Q: 2 CPU: Consider the following processes arriving at the ready queue and dispatched to a single core…

A: (a)- FCFSPID: 10 11 12 14 13 15Gantt: 0-9 9-12 13-19 19-20 20-21 21-23 -…

Question

Q// Assume that we have the workload shown below. All five processes arrive at time 0, in the
order given, with the length of the CPU burst given in milliseconds:
Process CPU Burst Time Priority
P1
10
P2
29
P3
3
P4
P5
12
1
A) Consider the FCFS, SJF, and RR (quantum = 10 milliseconds) scheduling algorithms for
this set of processes. Which algorithm would give the minimum average waiting time
and minimum average turnaround time?
B) Using the Priority algorithm, find the average waiting time and average turnaround
time.
C) If the CPU was idled for 2 milliseconds and the future knowledge algorithm was used,
did that enhance the average waiting time and average turnaround time for this
workload?
D) Suppose that a multilevel feedback queuing is used such that Q1 is RR with (quantum =
5 milliseconds) and the process's entrances to Q1 is done according to their priorities.
Q2 is fixed time SJF queue which specifies 4 milliseconds for each process. Q3 is FCFS
queue. Find the average waiting time and average turnaround time.
E) Suppose that a multilevel queuing is used which consists of 3 queues Q1, Q2, and Q3.
Q1 is RR with (quantum = 10 milliseconds) and specified for the processes of priorities
ranged from [0, 1]. Q2 is SJF which specified for the processes of priorities ranged from
[2,3]. Q3 is FCFS which specified for the processes of priorities ranged from [4 and
above]. Find the average waiting time and average turnaround time.

Expert Solution

This question has been solved!

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

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step 5

Trending now

This is a popular solution!

Step by step

Solved in 5 steps with 5 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

For Question, put your answer in the following blanks. Note: You must put answer only, no need to put the unit. One answer per blank.
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…
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
If a time quantum used in round-robin preemptive CPU scheduling is allowed to grow too large, the algorithm degenerates to: w m w ww ww w wwwww w www a) Shortest-Job-First (SJF). b) Shortest-Time-Remaining (STR). c) Job Exclusion (JBE). d) First-Come-First-Served (FCFS) e) Round Robin (RR)