Consider the following data [Figure]. Suppose round robin scheduling is applied on the given data with time quantum=Floor (XX % 3) units. It is also given that scheduling of a process or context switch will take 1 unit of time. What is the completion time and turnaround time of process P4? Where XX is the last two digits of your roll number. XX=18

Consider the following data [Figure]. Suppose round robin scheduling is applied on the given data with time quantum=Floor (XX % 3) units. It is also given that scheduling of a process or context switch will take 1 unit of time. What is the completion time and turnaround time of process P4? Where XX is the last two digits of your roll number. XX=18

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

11 Consider a situation where 5 instances of a resource are available. That means maximum 5 processes are allowed to enter the critical section at any point in time. Please provide a solution using a counting semaphore. Write the pseudocode for each process.
Show all the states clearly.
please complete and explain 2 us Suppose that there are 6 instances of one resource available to three processes A ethe fooing d collected. The table indicates the process, the maximum number of resources needed by the pocess and the number of resources currently owned by each process. Which of the following is true Process/ max/ allocated/ need PO /max: 5/ allocated: 3/ need: 2 P1/ max: 2/ allocated: 1/ need: 1 P2/max 5/ allocated: 2/ need: 3 O It is safe O The state cannot be determined. O It is not safe. O Deadiock will never occur with only one resource type. Suppose that there are 7 instances of one resource available to three processes. At time 0, the following data is collected. The table indicates the process, the maximum number of resources needed by the process, and the umber of resources currently owned by each process. Which of the following is true? Process/max/ allocated/ need PO /max 5/ allocated: 3/ need 2 P1/max 2/ allocated 1/ need: 1 P2 / max: 5/ allocated: 2/ need:…
You have given a task to allocate the resources to the process, every student have their Reg no as (SU-17-01-128) so take the resources as the last digit of your reg no as in above example is “8”. For Process count take your Roll num and add them as given “12” so add them as (1+2=3) the sum is “3” and them minus this sum with your age num as of (25-3=22) and then minus it with “10” so you get (22-10=12) so “12” is your process count. Do it for with Deadlock occur? Do it for without Deadlock occur?
Explain the influence of "changing time quantum" on process execution in Round- Robin scheduling by defining the term Time Quantum.
Process Arrival time Priority Burst time P1 8 P2 1 6. P3 9 P4 8 2 10 P5 3 2 Now, Calculate the avarage watiting time, avarage turnaround time and execution starting time for specific processes using Preemtive Priority scheduling algorithm, where A higher value represents Higer Priority. Insert the Execution Starting Time of Process P2 (only integer value, no decilam points. For example if your ans is 26.8 or 26.1, insert 26 only) Insert the Execution Starting Time of Process P3 (only integer value, no decilam points. For example if your ans is 26.8 or 26.1, insert 26 only) Insert the Execution Starting Time of Process P5 (only integer value, no decilam points. For example if your ans is 26.8 or 26.1, insert 26 only)
Apply the following scheduling algorithms to the list process. 1. Shortest Remaining Time 2. Round Robin:Quantom =3 For each process scheduling algorithm, provide the following: a. Finish time Turnaround time Waiting time b. A detailed gantt chart c. The average turnaround time d. The average waiting time
a single process, with execution time of BT time units, is detected by the system that uses Round Robin algorithm with time quantum of QT time units. Every time the time quantum elapses; a contect switch is always performed with CS time units. Assume that the process come at time equal to zero(0) If BT is 25, QT is 10 and CS is 2, what is the Cpu utilization of the system? If BT is 20, QT is 6 and CS is 1 what is the CPU utilization of the system? What is the CPU utilization if BT is equal QT and QT is equal to CS? What is the system's throughput if BT is less than QT? What is the system's turnaround time (TAT) if BT is less than QT?
Explain the influence of "changing time quantum" on process execution in Round-Robin scheduling by defining the term Time Quantum.
If a sporadic implicit deadline task set is schedulable under RM, will it be schedulable under RM after enlarging one of the deadlines (now it becomes an arbitrary deadline task set)? Note that we are still following the original RM priority order (not DM). What if we follow DM order?
5. Consider the following set of tasks in a real-time system: Tasks Release time Execution time Absolute deadline T 1 40 T2 10 30 T 3 7 60 T 4 10 10 20 T 5 12 6 70 Perform EDF (Earliest Deadline first) scheduling on this task set.
Give a brief explanation of "process starvation" and how to prevent it in priority scheduling.