In an operating system, there are 4 processes that are running with details as follows: CPU Burst Arrival Process Time Time A 12 B 2 4 7 D 3 10 You want to make sure, which schedule is better, among the First Come scheduling First Serve, Shortest Job First (preemptive) and Round Robin with time slice = 4. Simulate the three algorithms, calculate the average turnaround time and waiting time. Do comparison and determine the most efficient algorithm. In making comparisons, you should also look at the CPU Utilization side.

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...
icon
Related questions
Question
100%

COURSE Operating System

 Only correct answer will be upvoted. Else downvoted.

10. In an operating system, there are 4 processes that are running with details as
follows:
CPU Burst Arrival
Process
Time
Time
A
12
В
2
C
4
7
3
10
You want to make sure, which schedule is better, among the First Come
scheduling First Serve, Shortest Job First (preemptive) and Round Robin
with time slice = 4. Simulate the three algorithms, calculate the average
turnaround time and waiting time. Do comparison and determine the most
efficient algorithm. In making comparisons, you should also look at the
CPU Utilization side.
CPU Utilization can be calculated based on the formula:
Tr
Ts
1-p
Where
Tr
= turnaround time
Ts
= average Service time
= CPU utilization
Transcribed Image Text:10. In an operating system, there are 4 processes that are running with details as follows: CPU Burst Arrival Process Time Time A 12 В 2 C 4 7 3 10 You want to make sure, which schedule is better, among the First Come scheduling First Serve, Shortest Job First (preemptive) and Round Robin with time slice = 4. Simulate the three algorithms, calculate the average turnaround time and waiting time. Do comparison and determine the most efficient algorithm. In making comparisons, you should also look at the CPU Utilization side. CPU Utilization can be calculated based on the formula: Tr Ts 1-p Where Tr = turnaround time Ts = average Service time = CPU utilization
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY