Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
(a) Fill table T1 and compute total wait times if the queue is SJN or Shortest Job Next (note in case of a tie, the process arriving first is executed first). This is non-preemptive, so PO will be executed to the completion first (b) Repeat part (a) if the queue is SRT, which is the preemptive version of SJN. (so PO is kicked out by P1 at time 2, and P1 is kicked out by P2 at time 4, etc. Please make a new table T2 for this part (b).

(a) Fill table T1 and compute total wait times if the queue is SJN or Shortest Job Next (note in case of a tie, the process arriving first is executed first). This is non-preemptive, so PO will be executed to the completion first (b) Repeat part (a) if the queue is SRT, which is the preemptive version of SJN. (so PO is kicked out by P1 at time 2, and P1 is kicked out by P2 at time 4, etc. Please make a new table T2 for this part (b).

Computer Networking: A Top-Down Approach (7th Edition)
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
icon
Related questions
Question
Table 1. 4 processes arriving shown in Operating System Scheduling PDF for Shortest Job Next, non- preemptive Process Arrival Times Execution Times Service Times sequence Wait Times calculations PO 0 12 P1 21 9 P2 41 6 P3 6 3 Total wait time = ? Here the 4 processes of the PDF are repeated in Table 1, with arrival times changed to 0, 2, 4, and 6 respectively. Also, the execution times are changed to 12, 9, 6, and 3. You will be asked to fill table 1 with the numbers like the service times (when is each process serviced), the sequence of executions of these 4 processes in part (a) and part (b) below. Also, you will compute the total wait time. Note for FCFS, it is 1, 2, 3, 4 for P0, P1, P2, and P3; • for the SJN or Shortest Job Next with non-preemptive, PO is #1, P1 may not be #2; for SRT, or shortest remaining time, the preemptive version of SJN, PO is #1, but after 2 time units when P1 comes, P1 kicks out PO since its execution time is 4 < 9- 2 = 7; and P1 may be preempted by P2 later on, etc. You may use a time line to help computing when which process takes over. (a) Fill table T1 and compute total wait times if the queue is SJN or Shortest Job Next (note in case of a tie, the process arriving first is executed first). This is non-preemptive, so PO will be executed to the completion first (b) Repeat part (a) if the queue is SRT, which is the preemptive version of SJN. (so PO is kicked out by P1 at time 2, and P1 is kicked out by P2 at time 4, etc. Please make a new table T2 for this part (b). Note you may do this question manually or by program if you have a computer program, or any other methods you know.
Transcribed Image Text:Table 1. 4 processes arriving shown in Operating System Scheduling PDF for Shortest Job Next, non- preemptive Process Arrival Times Execution Times Service Times sequence Wait Times calculations PO 0 12 P1 21 9 P2 41 6 P3 6 3 Total wait time = ? Here the 4 processes of the PDF are repeated in Table 1, with arrival times changed to 0, 2, 4, and 6 respectively. Also, the execution times are changed to 12, 9, 6, and 3. You will be asked to fill table 1 with the numbers like the service times (when is each process serviced), the sequence of executions of these 4 processes in part (a) and part (b) below. Also, you will compute the total wait time. Note for FCFS, it is 1, 2, 3, 4 for P0, P1, P2, and P3; • for the SJN or Shortest Job Next with non-preemptive, PO is #1, P1 may not be #2; for SRT, or shortest remaining time, the preemptive version of SJN, PO is #1, but after 2 time units when P1 comes, P1 kicks out PO since its execution time is 4 < 9- 2 = 7; and P1 may be preempted by P2 later on, etc. You may use a time line to help computing when which process takes over. (a) Fill table T1 and compute total wait times if the queue is SJN or Shortest Job Next (note in case of a tie, the process arriving first is executed first). This is non-preemptive, so PO will be executed to the completion first (b) Repeat part (a) if the queue is SRT, which is the preemptive version of SJN. (so PO is kicked out by P1 at time 2, and P1 is kicked out by P2 at time 4, etc. Please make a new table T2 for this part (b). Note you may do this question manually or by program if you have a computer program, or any other methods you know.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS