PID Arrival Time Burst (ms) Priority 10094 11 4 3 2 12 7 10 7 13 12 7 2 14 15 2 9 15 22 5 3 Using the following scheduling algorithms: First - come first - served (FCFS) Preemptive shortest job first (PSJF) Preemptive Round - robin with 4 ms quantum Priority with a priority aging of +1 every 5 ms while in the ready queue Answer the following: (a) Draw a Gantt chart showing the arrival time and run times for each process. (b) Calculate the wait time for each process and average waiting time. (c) Calculate the turnaround time for each process.

PID Arrival Time Burst (ms) Priority 10094 11 4 3 2 12 7 10 7 13 12 7 2 14 15 2 9 15 22 5 3 Using the following scheduling algorithms: First - come first - served (FCFS) Preemptive shortest job first (PSJF) Preemptive Round - robin with 4 ms quantum Priority with a priority aging of +1 every 5 ms while in the ready queue Answer the following: (a) Draw a Gantt chart showing the arrival time and run times for each process. (b) Calculate the wait time for each process and average waiting time. (c) Calculate the turnaround time for each process.

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

Fill in blank Consider MLFQ (Multi-Level Feedback Queue) scheduling. The time quantum is set to 2 units for the top queue (queue 0). For n > 1, the time quantum of queue n is incremented by 5 units from that of queue n-1. A job that requires 39 units of burst time (with no IO) will terminate its execution in queue ----------
Given the following processes that arrived on the system as indicated in the table. The table also mention the burst time and priority of each one. Process Arrival time Burst time Priority P1 12 3 P2 7 1 P3 2 2 How the system will allocate the CPU based on Round Robin with time quantum equal to 3– suppose that all processes arrived at time 0. Processes are selected to enter the queue according to priority. So, instead of processes entering the queue in the order P1, P2 and P3. They will enter according to their priority from highest to Lowest. So, they will enter the queue in the order P2, P3, P1. Afterwards, you execute the Round Robins algorithm and draw the Gantt chart.
Apply Interthread communication to solve the Producer-Consumer problem with a common or shared bounded buffer(Queue) holding upto 5 elements. The producer consumer problem is a synchronization problem. There is a fixed size buffer and the producer produces items and enters them into the buffer. The consumer removes the items from the buffer and consumes them. A producer should not produce items into the buffer when the consumer is consuming an item from the buffer and vice versa. So the buffer should only be accessed by the producer or consumer at a time. When ever buffer is filled up and no more space to add the element into the queue(buffer) producer has to wait until the buffer is emptied by consumer. When ever the buffer is empty and no more items are available for consumption the consumer should wait for producer to produce elements. Write a solution for N elements, where N is multiple of 5 or greater than 5 other than 0.
The Weighted Interval Scheduling Problem is defined as n requests labelled 1,...,n, with each request i specifying a start time si, a finish time f; and a weight v. For each request i, s;< f;. Assume the requests are sorted in order of non-decreasing finish times: f₁s f₂s... fr. Two requests i and j, i
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 133, and the previous request was at cylinder 115. The queue of pending requests, in FIFO order, is:76,1460, 903, 1764, 938, 1499, 1012,1740,120. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? (a) FCFS (b).SSTF (c) SCAN (d) LOOK (e) C-SCAN (f) C-LOOK
A disk drive has 1000 cylinders, numbered 0-999. The driver is currently serving a request at cylinder 650 and the head was previously serving a request at cylinder 380. The queue of pending requests is in the order received as below: 455 207 638 782 132 56 222 890 686 422 By referring to the above cylinders, solve the total head movements using the following diskseek strategies: (i) FCFS Scheduling ,SSTF Scheduling, SCAN Scheduling and LOOK Scheduling
Suppose Dr. WhyLie comes up to you and claims that he has invented a super-fastcomparison based priority queue. The speed of the priority queue operations are as follows(n is the number of items currently in the priority queue):a. insert a new item in O(sqrt(log n)) timeb. extract (remove and return) the smallest item from the priority queue in O(sqrt(logn)) time.Explain why Dr. WhyLie must be lying.
Problem Suppose, there are three producers P1, P2, and P3 who want to produce and put items in the buffer. And, there are four consumers C1, C2, C3, and C4 who want to consume items from the buffer. No process takes more than 5 units of time to complete unless the process goes to the waiting queue(S->list) of semaphore. At a certain point of the execution, following are the values of the semaphores: mutex=1 , countEmpty=8, countFull=2 Find the output of the following sequence of commands. At time 0 : C1 started At time 0: C2 started At time 10: C3 started Value of countEmpty: ANSWER: Value of countFull: ANSWER: Processes in the waiting queue of the semaphore: [Write process names with Capital letter, For example: P7. If there are multiple process writes their names using comma, For example: P6,P7. If there is no process in the semaphore's list, write EMPTY in the box] ANSWER: At time 15 : P1 started At time 20 : P2 started Value of countEmpty: ANSWER: Value of countFull: ANSWER:…
ng Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,100, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069; 1,212; 2,296; 2,800; 544; 1,618; 356; 1,523; 4,965; 3,681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? A- FCFS B- C-SCAN (the head by default goes to the higher cylinder first.)
Direction: Consider the following set of jobs. Schedule these jobs using Multilevel Feedback Queue with the highest priority queue in Q1 implementing RR with quantum time (QT) = 4, second priority queue Q2 implementing RR with QT =10, and least priority queue Q3 that uses FCFS algorithm as shown below. Draw the Gantt chart showing the CPU execution to these jobs and answer the queries below: Jobs Burst Time Arrival Time J1 17 J2 1 J3 30 15 J4 15 17 J5 20 30
929. Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently serving a request at cylinder 50, and the previous request was at cylinder 55. The queue of pending requests, in FIFO order, is: 82,170,43,140,24,16,190. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for the following disk- scheduling algorithms? (You will get full credit if you can work out 3 out of the 5 algorithms. Please clearly indicate which 3 algorithm you did.) a. FCFS b. SSTF C. SCAN d. LOOK e. C-SCAN
Given the following list of jobs and their associated priority class (the lower the number the higher the priority): ➞ | J45 | J12 | J17 | J22 | J30 | J56 | J18 | ➞ (back) | 3 | 4 | 2 | 1 | 3 | 2 | 4 | (front) Assuming that no other jobs arrive, list the order in which these jobs would be processed if: a) a priority queue is used. b) Describe three different schemes by which a priority class might be assigned to a job. c) Explain what is meant by “starvation” d) Explain what is meant by “aging”