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?
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?
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...
Related questions
Question
![Q// Assume that we have the workload shown below. All five processes arrive at time o, in the
order given, with the length of the CPU burst given in milliseconds:
Process CPU Burst Time Priority
2
P1
10
P2
29
P3
3
4
P4
PS
12
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.
a1 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.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6f53ec42-5585-411c-ad6d-ba59dd011147%2Ffd76cc88-ac35-4ef3-81bc-67dd40df2bc4%2Fi2wxmr9_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Q// Assume that we have the workload shown below. All five processes arrive at time o, in the
order given, with the length of the CPU burst given in milliseconds:
Process CPU Burst Time Priority
2
P1
10
P2
29
P3
3
4
P4
PS
12
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.
a1 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!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 6 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY