Q24. Consider the set of 5 processes whose arrival time, burst time, and priority are given below: Arrival Time Burst Time Process ID P1 P2 P3 P4 P5 Calculate the average waiting time if the CPU scheduling policy is: a. Shortest Job First b. Shortest Remaining Time First C. Round Robin with time quantum = 2-time units 0 2 5 9 12 11 8 10 6

Q24. Consider the set of 5 processes whose arrival time, burst time, and priority are given below: Arrival Time Burst Time Process ID P1 P2 P3 P4 P5 Calculate the average waiting time if the CPU scheduling policy is: a. Shortest Job First b. Shortest Remaining Time First C. Round Robin with time quantum = 2-time units 0 2 5 9 12 11 8 10 6

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

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
Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C D T0 2 1 0 6 6 3 2 7 2 1 3 1 T1 3 3 1 3 5 4 1 5 T2 2 3 1 2 6 6 1 4 T3 1 2 3 4 4 3 4 5 T4 3 0 3 0 7 2 6 1 What are the total resources for A, B, C and D respectively? Select one: a.11, 10, 8, 16 b. 13, 10, 11, 16 c.11, 9, 8, 15 d.28, 18, 14, 22
For the following processes, estimate average waiting time for priotiry scheduling combines with round robin scenario.Consiider quanta of 1s. Process Burst TimePriority P1 10 3 P2 1 P3 2 2 P4 1 Ps 2 P6 3
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
Supermarkets are constantly faced with a problem similar to page replacement in virtual memory systems. They have a fixed amount of shelf space to display an ever increasing number of products. If an important new product comes along, say, 100% efficient dog food, some existing product must be dropped from the inventory to make room for it. The obvious replacement algorithms are LRU and FIFO. Which of these would you prefer?
The table below shows 5 jobs in a time-sharing system. What is the average response time if the Round Robin method is used to manage the processes with a time quantum of 1 millisecond. Process Arrival Time CPU Burst Time(ms) P1 8 P2 1 1 P3 3 4 P4 3 6 P5 3 2 Lütfen birini seçin: О а. 21 O b. None of them О с. 12.6 O d. 16.8 O e. 8.4
Given a set of jobs {J1, ... , Jn}, each job Ji = < ti, wi > has a required processing time ti and aweight wi. Design an efficient algorithm (pseudo code) to minimize the weighted sum of overall completion times ∑ni=1wiCi, where Ci is the completion time of job i. What is the time complexityof your algorithm? Note: You first need to briefly explain your ideas to solve the problem, e.g. what data structures are used, how the intermediate results are saved, which sorting strategy is used, and why the final results are correct;
If a time quantum used in round-robin preemptive CPU scheduling is allowed to grow too large, the algorithm degenerates to: w m w ww ww w wwwww w www a) Shortest-Job-First (SJF). b) Shortest-Time-Remaining (STR). c) Job Exclusion (JBE). d) First-Come-First-Served (FCFS) e) Round Robin (RR)
There are 12 processors in a network, each processor stores a different piece of information about a certain task. Assume that the time required to send information from one processor to another processor regardless of its size takes 100 microseconds. It is required that all the information (12 different pieces) about this task be available to all of the 12 processors. a) Find an algorithm to solve this problem in minimum time? b) Calculate its complexity and efficiency? c) Implement the above problem and submit the code.