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. Arrival Burst Process Priority time time P1 12 3 P2 7 1 P3 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.

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. Arrival Burst Process Priority time time P1 12 3 P2 7 1 P3 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.

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 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.
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. 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
Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a requestat cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is madewith none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3,39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, whatis the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and alsocalculate the total seek time needed to serve these requests, for each of the following disk-schedulingalgorithms? Explain with the help of a diagram in each case. a. FCFSb. SSTFc. SCANd. LOOK
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?
Assume we have a hard disk with 300 cylinders (numbered 0 to 299) with the disk head starting at cylinder 120 (moving toward cylinder 299). We have the following queue of hard disk requests: 160, 230, 100, 80, 180, 200, 240, 290. Draw a diagram below (as in Figure 1) showing the movement of the head over time for the FCFS algorithm, and calculate the total movement of the disk head (in cylinders). (Assume that no other requests for cylinders arrive while this algorithm is executing.) Figure 1: Disk Scheduling for FCFS algorithm (see image attached ) Assume we have the same hard disk as problem III(b). For reference, the disk has 300 cylinders (numbered 0 to 299) with the following queue of hard disk requests: 160, 230, 100, 80, 180, 200, 240, 290. Draw a diagram below (like Figure 1) showing the movement of the head over time for the SCAN algorithm, and calculate the total movement of the disk head (in cylinders). (Assume that no other requests for cylinders arrive while this…
Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is
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
Assume that the Ready Queue contains several Processes with varying burst times. If the scheduling algorithm is Round Robin with a time quantum longer than the burst times of all processes, which processes will be completed first? Your response: o Initial Procedure O Final Procedure The quickest method • Longest Process?? O Process with a burst time equal to time quantum (q)
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?
Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN