A multi-level feedback queue scheduling algorithm partitions the ready queue into several separate queues. Construct a Gantt chart to illustrate the execution for the set of processes shown in Table 1, if multi-level feedback queue scheduling is used. Assume we have 3 levels of queues as follows: Q3. • Q0 – Round Robin (RR) with time quantum 2 milliseconds • QI – RR with time quantum 4 milliseconds • Q2 – First-come-first-serve (FCFS) Process Arrival Time Execution Time A 8 4 4 10 D 8 E 10 8 F 12 10 2.

A multi-level feedback queue scheduling algorithm partitions the ready queue into several separate queues. Construct a Gantt chart to illustrate the execution for the set of processes shown in Table 1, if multi-level feedback queue scheduling is used. Assume we have 3 levels of queues as follows: Q3. • Q0 – Round Robin (RR) with time quantum 2 milliseconds • QI – RR with time quantum 4 milliseconds • Q2 – First-come-first-serve (FCFS) Process Arrival Time Execution Time A 8 4 4 10 D 8 E 10 8 F 12 10 2.

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

Transcribed Image Text Consider the following set of processes, with arrival times and the length of the CPU burst time given in milliseconds. a. Draw a Gantt chart that illustrates the execution of these processes using the Shortest-Remaining Time First (SRTF) scheduling algorithm. b. Give the average waiting time of Shortest-Remaining Time First (SRTF) scheduling algorithm. Note: Preempted processes are added to the end of the ready queue. Process Arrival Time Burst Time A 4 B 1 3 1 D 3 4 3
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?
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. 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?
Consider the following processes:Process Arrival Time Service Time A 0 4 B 1 3 C 2 3 D 2 2 E 3 1 F 5 3 Show (draw the schedule, x-axis is time, and one row for each CPU) how the aboveprocesses execute over time on a system with 2 CPUs. Compute the average turnaroundtime for all processes and the average utilization for each CPU under each of the following schedulers: (a) FCFS with a single Ready Queue. A process gets scheduled once one of the CPUsis available. When both CPUs are available, we select CPU1. (b) FCFS with a Ready Queue per CPU. Processes A, B, and C go to CPU1 and processesD, E, and F go to CPU2. (c) HRRN with a single Ready Queue. A process gets scheduled once one of the CPUsis available. When both CPUs are available, we select CPU1.
In the picture attached, the Say that the system is running 3 jobs, A, B, and C, and that all of them are CPU-intensive (i.e., each one does one infinitely long CPU burst). The system begins with A on the CPU at the beginning its time quantum while B and C are in the Ready Queue, in that order. a) Show the execution pattern (as a string of A’s, B’s, C’, and o’s) assuming that the scheduler time quantum is equal to 4 ms. Show the execution for more than 20ms (but less than 30ms). b) In the long run (i.e, assuming jobs don’t ever terminate), what percentage of the CPU time is wasted doing context-switching/scheduling? The answers I came up with is as follows: a) AAAAoBBBoCCCoAAAoBBBoCCCoAAA, because for the first 4ms, A gets to execute it's full time quantum, however, when context-switching to the next job, the switch is included in the time quantum. b) 2.77% spent context switching, divide the number of o's by the total amount of runtime.
we need to make a c program using multi process approach , one process will initialize 7 processes the first one of them will create the other 6 processes each one of them will do one of this algorithms fcfs , sjf,srtf,rr with quantum = 5 Preemptive Priority Scheduling, with aging; where priority is decremented by 1 if the process remains in the ready queue for 5 time units. 6- Non-preemptive Priority Scheduling, with aging; where priority is decremented by 1 if the process remains in the ready queue for 5 time units and it must schedule them and keep updating the status (and printing it ) like ready , waiting,executing,etc. of the processes in this set of processes : Process Arrival Time Burst Time Comes-back-after Priority P1 0 10 2 3 P2 1 8 4 2 P3 3 14 6 3 P4 4 7 8 1 P5 6 5 3 0 P5 7 4 6 1 P7 8 6 9 2 the prgoram must print the results which are : the Gantt chart, average waiting time, and average turnaround time. , note that Burst Time is the maximum duration allowed at a single go…
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
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:…
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?
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
Consider the FCFS, SJF, and RR (quantum = 8 milliseconds) scheduling algorithms for this set of processes. Process Burst Time P1 8 P2 25 P3 3 P4 7 P5 11 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a) Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, and RR. b) What is the waiting time of each process for each of these scheduling algorithms? c) Which of the algorithms results in the minimum average waiting time (overall processes)? d) Derive the Need (max-Alloc) matrix. It should be presented like the Allocation or Maximum matrices above. e) If the request from process P1 arrives for (0,1,2,0), can the request be granted? Why?
In question b, the difference between processing delay and queue time is discussed in full. Think about the following example: