Consider the following set of processes with the length of next CPU burst given in milliseconds: P1 - 8 ms, P2 - 2 ms, P3 - 15 ms, P4 - 5 ms: a) Draw the Gantt chart illustrating the execution of these processes using the NON-preemptive Shortest Job First scheduling algorithm, and calculate the average waiting time. b) Knowing the arrival time: P1-0, P2-3, P3-5, P4-7, draw the Gantt chart and calculate the average waiting time for the equivalent pre-emptive algorithm, the Shortest Remaining Time First scheduling algorithm. c) Compare the number of context switches of the two scheduling algorithms: - How many context switches do you have in the 1st and in the 2nd algorithm? - Which is the best one?
Consider the following set of processes with the length of next CPU burst given in milliseconds: P1 - 8 ms, P2 - 2 ms, P3 - 15 ms, P4 - 5 ms: a) Draw the Gantt chart illustrating the execution of these processes using the NON-preemptive Shortest Job First scheduling algorithm, and calculate the average waiting time. b) Knowing the arrival time: P1-0, P2-3, P3-5, P4-7, draw the Gantt chart and calculate the average waiting time for the equivalent pre-emptive algorithm, the Shortest Remaining Time First scheduling algorithm. c) Compare the number of context switches of the two scheduling algorithms: - How many context switches do you have in the 1st and in the 2nd algorithm? - Which is the best one?
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
Consider the following set of processes with the length of next CPU burst given in milliseconds:
P1 - 8 ms, P2 - 2 ms, P3 - 15 ms, P4 - 5 ms:
a) Draw the Gantt chart illustrating the execution of these processes using the NON-preemptive Shortest Job First scheduling
b) Knowing the arrival time: P1-0, P2-3, P3-5, P4-7, draw the Gantt chart and calculate the average waiting time for the equivalent pre-emptive algorithm, the Shortest Remaining Time First scheduling algorithm.
c) Compare the number of context switches of the two scheduling algorithms:
- How many context switches do you have in the 1st and in the 2nd algorithm?
- Which is the best one?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 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