Suppose that we have the table below that includes four processes with their Arrival timesand Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPUscheduling. Answer the following questions:ProcessArrivalCPU-burstIDtimetimeP101P233P324P443CompletionTimeResponseTurn AroundTimeTimeWaitingTimea. Draw the Gantt chart.b. Complete the above table.c. Calculate the average waiting time.

In this question we have been given woth the four processes with their Arrival and CPU-burst times,…

Suppose that we have the table below that includes four processes with their Ar times and Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPU scheduling. Answer the following questions: Waiting Process Arrival CPU-burst ID time time Completion Time Response Time Turn Around Time Time P1 0 1 P2 3 3 P3 2 4 P4 4 3 a. Draw the Gantt chart. b. Complete the above table. c. Calculate the average waiting time.

Suppose that we have the table below that includes four processes with their Ar times and Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPU scheduling. Answer the following questions: Waiting Process Arrival CPU-burst ID time time Completion Time Response Time Turn Around Time Time P1 0 1 P2 3 3 P3 2 4 P4 4 3 a. Draw the Gantt chart. b. Complete the above table. c. Calculate the average waiting time.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider four processes with the following start and end times: Process Start Time End Time ABCD 3 5 1 7 6 12 4 9 For each pair of proceses, say whether they run concurrently (Y) or not (N). (a) AB (b) AC (c) AD (d) BC (e) BD (f) CD
Consider the following set of processes A, B, C, D with the following CPU burst time and I/O. Find the average waiting time with RR of quantum 10ms and context switch time=2ms. What is the average waiting time? Write the waiting time for processes A,B,C,D.
Asap
Consider the following processes with the given CPU arrival time and burst time. Please use the round-robin with quantum 10 to compute for the waiting times for each process.
a single process, with execution time of BT time units, is detected by the system that uses Round Robin algorithm with time quantum of QT time units. Every time the time quantum elapses; a contect switch is always performed with CS time units. Assume that the process come at time equal to zero(0) If BT is 25, QT is 10 and CS is 2, what is the Cpu utilization of the system? If BT is 20, QT is 6 and CS is 1 what is the CPU utilization of the system? What is the CPU utilization if BT is equal QT and QT is equal to CS? What is the system's throughput if BT is less than QT? What is the system's turnaround time (TAT) if BT is less than QT?
Consider the following set of processes, with the length of the CPU burst given in milliseconds
BenchmarkProcessorXYZ12010402408020Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines.ii.Compute the geometric mean value for each system, using X as the reference machine and then using Y as the reference machine. Argue that the results are more realistic than with the arithmetic mean.
BenchmarkProcessorXYZ12010402408020Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines.i.Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results.
In a timesharing OS we have the following cpu timeline for two tasks X and Y. The timeslice is 1s.Both tasks are available in the system at the same time t=9:00:00.000 and order of arrival is the obviousX followed by Y. (The decimals reflect milliseconds if they showup in an indicated time reference.) There are no other processes (tasks) in the system other than X,Y. 1234567890 XYXYX--YXY The time line 1 indicates that at t=9:00:00s task X starts its execution and when t=9:00:01s is reached task Y takes over. The time line 1 indicates the 'first second' and time line 0 indicates the 'tenth second' above.Task Y completes its execution at t=9:00:10s, the completion of the tenth second since X started its execution. Task X has completed its execution earlier. (a) What is the total number of context switches starting from prior to t=9:00:00s (e.g. t=8:59:59.999) through thecompletion of $Y$? answer is 16s (b) What is the turnaround time for Y? answer is 10s (c) What is…
Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for example, IWWS represents the sequence of calls init(s), wait(s), wait(s), and signal(s) by some processes in an operating system. For each of the following sequences of calls, state the value of s and the number of processes blocked after the last call in the sequence: *(a) IW (b) IS (c) ISSSW (d) IWWWS (e) ISWWWW
Consider the following set of 5 processes, with the length of the CPU-burst time given in milliseconds arriving at time 0: P1, P2, P3, P4, and P5 with corresponding burst time: 20, 47, 13, 17 and 22. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Calculate average waiting time for First Come First Serve and None Preemptive Shortest Job First CPU scheduling algorithms. b. Which of the schedules in part a results in the minimal average waiting time (over all processes)?
In the above, we had the three concurrent processes p1, p2 and p3, each with the number s1 = 2, s2 = 3 and s3 = 2 of states, respectively.