Choose the correct answer with explanation Consider there are 5 processes arriving in a system that implement Multi-Level Feed Back queue (MLFQ) scheduler at 5,8,25,27,29 respectively. Their burst times are 14,2,5,2,2 respectively. There are 3 ready queues: queue 1 and queue 2 implement RR scheduling algorithm with time quanta of 2 and 5. And the third queue implements FCFS. Which process has the highest completion time? P1 P2 P3 P4 Explanation:

Choose the correct answer with explanation Consider there are 5 processes arriving in a system that implement Multi-Level Feed Back queue (MLFQ) scheduler at 5,8,25,27,29 respectively. Their burst times are 14,2,5,2,2 respectively. There are 3 ready queues: queue 1 and queue 2 implement RR scheduling algorithm with time quanta of 2 and 5. And the third queue implements FCFS. Which process has the highest completion time? P1 P2 P3 P4 Explanation:

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

P is a set of processes. R is a set of resources. E is a set of request or assignment edges. The sets P, R,and E are as follows:P = {P1, P2, P3}R = {R1, R2, R3}E = {P1 -> R1, P2 -> R3, P3-> R2, R1 -> P2, R2 -> P2, R2 -> P1, R3 -> P3}R1 has one instance. R2 has two instances. R3 has one instance.a. Explain clearly with the help of a properly labelled diagram what is a resource allocation graph?Draw the resource-allocation graph for the given case also. [2 + 1]b. Is there any deadlock in this situation? Explain your answer clearly.
P is a set of processes. R is a set of resources. E is a set of request or assignment edges. The sets P, R, and E are as follows: P = {P1, P2, P3} R = {R1, R2, R3} E = {P1 -> R1, P2 -> R3, P3-> R2, R1 -> P2, R2 -> P2, R2 -> P1, R3 -> P3} R1 has one instance. R2 has two instances. R3 has one instance. a. Explain clearly with the help of a properly labelled diagram what is a resource allocation graph? Draw the resource-allocation graph for the given case also. b. Is there any deadlock in this situation? Explain your answer clearly.
In operating systems or database systems, multiple processes have to access shared resources sequentially. When two or more processes are waiting for accessing shared resources circularly, a deadlock may occur that prevents the progress of all involved processes. One deadlock detection algorithm uses a “wait-for” graph to track all other processes that a process is currently blocking on. In a wait-for graph, processes are represented as nodes, and an edge from process P to Q denotes that P is waiting for a resource Q is holding. Thus a cycle in the wait-for graph shows a possibility of a deadlock. Design an efficient algorithm (pseudo code) for detecting deadlock. Analyze its complexity.
There are few documents stuck for printing in a printing queue. The person responsible for printing performs certain random operations to get the documents running. For the above scenario which type of scheduling is suitable and why?
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 ? Value of countFull ? 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] At time 15 : P1 started At time 20 : P2 started Value of countEmpty ? Value of countFull ? Processes in the waiting queue of the…
Consider a computer system which has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in any way that is, two in one shot or one by one. The system always satisfies a request for a resource if enough resources are available. If the processes don't request any other kind of resource, show that the system never deadlocks?
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:…
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
Suppose a priority queue stores the orders from an online store. 95 percent of all orders are “regular”orders, which have the same lowest priority (that is, for them getPriority() returns the highest value),and they must be processed in first-come-first-served order. The remaining 5 percent of orders are “rush”orders, which may have different higher priorities (that is, for them getPriority() returns lower values), and they must be processed in order of priority (and, within the same priority, in any order). True or false? The following implementation is appropriate for handling this task: Min Heap
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.
Suppose there are N worker processes defined as follows. Develop a monitor BarrierSyn with a procedure passBarrier() for barrier synchronization. Use the Signal and Continue discipline. Hint: In the monitor BarrierSyn, you may define a condition variable oktopass and use signal_all(oktopass) primitive to wait up all delayed processes on the condition variable. process Worker[i = 1 to N] { while (true) { code to implement task i; BarrierSyn.passBarrier(); } }
A disk drive has 24 cylinders (0-23). Initially, the head points to cylinder 8 (moving towards cylinder 0). For C-SCAN and C-LOOK, requests are serviced while the head is moving from inner cylinder (0) to outer cylinder (23). You must count also the cylinders when the head is moving without servicing. The following requests are in the queue (where the requests arrival is from left to right): 11 - 3- 17 - 4 - 10 - 12 - 8 - 9 - 22 - 13. What is the total head movements using the following scheduling algorithms: a) FCFS: b) C-SCAN: c) SSTF: d) C-LOOK: