Process Priority Еxec 1/0 Еxec 1/0 P1 4 4. 3. 2 P2 3 2 P3 1 3 4 1 P4 1 4 1 Assume that a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the process with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process. Draw the timeline for CPU- and I/0- bursts for these processes

Process Priority Еxec 1/0 Еxec 1/0 P1 4 4. 3. 2 P2 3 2 P3 1 3 4 1 P4 1 4 1 Assume that a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the process with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process. Draw the timeline for CPU- and I/0- bursts for these processes

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

in round robin when three processes have to enter the ready queue at the instant , if one process has just finished I/O the other has preempted from CPU due to expiration of its quantum and third (C) has just started. which one will be inserted last (ie lowest priority ) ? a) the process that has just finished I/O b) One of the three will be random be selected c) The process that has been pre-empted from CPU due to expiration of its quantum time. d) The process that has just started
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. Identify the user group that would find this most advantageous. Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. What are the parameters that affect the efficiency of the round robin?
Four processes arrive at the same time with their priorities, execution times and I/O times given in the table below. Assuming a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the process with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process, at each turn; a-)Draw the timeline for CPU- and I/O- bursts for these processes b-)Calculate average turn-around time
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. 5.1 Explain the advantages and disadvantages of this scheduling policy. 5.2 Identify the user group that would find this most advantageous. 5.3 Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. 5.4 What are the parameters that affect the efficiency of the round robin?
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. Question 5 Explain the advantages and disadvantages of this scheduling policy. Identify the user group that would find this most advantageous. Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. What are the parameters that affect the efficiency of the round robin?
Processes P1, P2, and P2 are queued to run. The arrival time of P1 is t = 0, the arrival time of P2 is t = 1, and the arrival time of P3 is t = 2. According to the first come first serve (FCFS) algorithm, processes are run by the operating system. P1 operates 7 time units, P2 4 time units, P3 operates 1 time unit. So what is the average waiting time (in time units) for this system? 0 5 3 7
b.Start from the resource allocation state in Q 13. If a request from a process P3 arrives for (1, 2, 3), can the request be immediately granted ? Why or why not ? c.Start from the resource allocation state in Q 13. Suppose that P4 asks for 2 instances of resource B. Can the system grant this if it wants to avoid deadlock ? Explain.
Suppose there are 8 processes in a system which are waiting to be assigned to the ready queue. The processes have the following properties. Process P1 has burst time 15, priority 6 Process P2 has burst time 12, priority 4 Process P3 has burst time 6, priority 12 Process P4 has burst time 5, priority 11 Process P5 has burst time 8, priority 9 Process P6 has burst time 9, priority 2 Process P7 has burst time 2, priority 20 Process P8 has burst time 17, priority 6 You have to use Multilevel Feedback Queue. It has three queues. The first queue takes processes with priority value from 1 to 5, the second queue takes processes with priority value of 6 to 10 and rest of the processes go to the third queue. First queue follows Round Robin Scheduling with time quantum= 4 Second queue follows Round Robin Scheduling with time quantum = 6 Third queue follows FCFC scheduling. Draw the gantt chart and calculate the average waiting time.
An interactive system using round-robin scheduling and swapping tries to giveguaranteed response to trivial requests as follows: After completing a round robin cycleamong all ready processes, the system determines the time slice to allocate to eachready process for the next cycle by dividing a maximum response time by the number ofprocesses requiring service. Is this a reasonable policy?
A job scheduler receives job requests with a priority of execution attached to it,in the following sequence. The higher the priority value, the higher the priority of job execution.Job ID: 464 212 110 840 976 343Priority: 3 2 3 1 2 2Build a treap for the jobs scheduled for execution. How would the treap look when the highest priority jobs have completed execution and therefore have quit the treap?
Suppose at time T0, following is the snapshot of a system with 6 process (P0, P1, P2, P3, P4, P5) and 3 resources (A, B, C) having 8, 10 and 12 instances respectively.Allocation Max A B C A B CP0 2 3 1 4 4 4P1 1 0 3 3 3 3P2 0 2 2 1 2 3P3 1 2 1 2 2 2P4 0 2 1 0 3 5P5 2 0 2 2 1 2Now, if process P4 make a new request (0, 1, 2) for resources then state that whether this request can be granted or not using Banker’s Algorithm.
(2)How many safe sequences are there for the above snapshot? Briefly justify your answer. (3)If P1 requests an additional instance of each of A and C, that is, P1's request becomes (2, 4, 6), will this request result in a deadlock? If the answer is no, give a safe sequence. If the answer is yes, identify the processes that will be involved in the deadlock. Show your work.