Table 1. 4 processes arriving shown in Operating System Scheduling PDF for Shortest Job Next, non-preemptiveProcess Arrival Times Execution Times Service Times sequence Wait Times calculationsPO012P1219P2416P363Total wait time = ?Here the 4 processes of the PDF are repeated in Table 1, with arrival times changed to 0, 2, 4, and 6respectively. 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), thesequence of executions of these 4 processes in part (a) and part (b) below. Also, you will compute the total waittime.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 whenP1 comes, P1 kicks out PO since its execution time is 4 < 9- 2 = 7; and P1 may be preempted by P2 lateron, 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 caseof a tie, the process arriving first is executed first). This is non-preemptive, so PO will be executed to thecompletion first(b)Repeat part (a) if the queue is SRT, which is the preemptive version of SJN. (so PO is kickedout 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 methodsyou know.

The topic is related to the scheduling of processes in an operating machine, specifically focusing…

(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)

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

Similar questions

a. b. C. d. e. f. After many insertions and deletions of items to a circular queue; the final status looks like the figure given below: myFront = 4 and myBack = 2 1 myBack 0 X P A D 3 How many items are in the circular queue? What are the items? (Write characters) What is the front item (letter) in the queue? What is the rear item (letter) in the queue? If 'F' is inserted in the existing queue; what will be the value of myBack and myFront? myFront = and myBack = If the front item is removed; myBack? myFront = myFront what will be the value of myFront and and myBack =
Build a Binary Search Tree with the given input order. You must show step by step process of inserting the inputs including both recursive calls and tree diagrams for each step. [ refer to the Insertitem function of Lecture 10 slides to get an idea of doing this.] N.B: Unique Input orders for each student to build the tree are given on a separate file. Write down the input order on your answer script before answering the question. You must use the assigned input order. Do not change the order. TREE INPUT: 4,1,9,3,2,5,6,8,7
S1 and S2 are two sorted stacks of n and m numbers sorted in decreasing order, with their top items pointing to the smallest in their lists, respectively. Create a stack MERGE that merges the items in stacks S1 and S2, so that at the conclusion of the merge, all of the elements in S1 and S2 are available in MERGE in decreasing order, with the largest element at the top.Keep in mind that the number of components in stack MERGE is (n + m).
Given two (singly) linked lists, determine if the two lists intersect. Return the intersecting node. Note that the intersection is defined based on reference, not value. That is, if the kthnode of the first linked list is the exact same node (by reference) as the jth node of the secondlinked list, then they are intersecting.