Recent questions tagged scheduling

Three processes $P_1$, $P_2$, and $P_3$ are scheduled using Round Robin.Assume:Each process has one kernel threadTime quantum $=\text{10 ms}$Context switch time $=\text{1...

Match the following$$\begin{array}{ll}\text{I. FCFS} & \text{i. Optimal Waiting Time} \\\text{II. SJF} & \text{ii. Convoy effect} \\\text{III. Round Robin} & \text{iii. N...

Consider the following five processes: $$\begin{array}{|c|c|c|c|}\hline\text{Process} & \text{Arrival Time} & \text{Burst Time} & \text{Priority} \\\hlineP_1 & 0 & 4 & 1 ...

Which of the following statements about priority scheduling are correct?Priority scheduling can behave like SJF if the predicted CPU burst time is used as the priority. A...

Which of the following statements are correct?LJF is a non-preemptive scheduling policy that selects the ready job with the largest original CPU burst. LRTF is a preempti...

Three processes have the following CPU burst times:$P_1=7$$P_2=1$$P_3=16$At time $0$, only $P_1$ and $P_3$ are ready. Process $P_2$ becomes ready at time $2$.If Shortest ...

Consider the following processes. All processes arrive at the same time.\[\begin{array}{c|c|c}\text{Process} & \text{Burst Time} & \text{Priority} \\\hlineP_1 & 10 & 3 \\...

Consider the following processes:$$\begin{array}{c|c|c} \text{Process} & \text{Arrival Time} & \text{Processing Time} \\ \hline P_1 & 0 & 2 \\ P_2 & 1 & 6 \\ P_3 & 4 & 1 ...

Which of the following statements are correct?A Round Robin scheduler may preempt the currently running job. A Shortest-Time-to-Completion-First scheduler cannot cause jo...

The actual CPU bursts of a process begin as: $$6, 4, 6, 4, 13, \ldots$$The initial predicted CPU burst is: $\tau_0 = 10$ Using exponential averaging with: $$\alpha = 0.7$...

Three jobs arrive at approximately the same time, with $A$ arriving slightly before $B$, and $B$ slightly before $C$. Their CPU burst times are: $A = 2$ seconds $B = 8$ s...

Which of the following statements are correct? A FIFO scheduler has lower average turnaround time when long jobs arrive after short jobs, compared with when short jobs ar...

Consider the following processes: $$\begin{array}{|c|c|c|}\hline\text{Job} & \text{Arrival Time} & \text{CPU Burst Time} \\ \hline A & 0 & 8 \\ B & 2 & 4 \\ C & 5 & 7 \\ ...

Which of the following are standard performance criteria used to evaluate CPU-scheduling algorithms?Waiting time Response time Throughput Page-fault rate

Which of the following statements about operating-system schedulers are correct?The long-term scheduler selects jobs from the job pool and admits them for execution. The ...

10. Which of the following scheduler is used to decrease the load on the CPU?A ) Medium Term SchedulerB) Short Term SchedulerC) Long Term SchedulerD) None of the above.

Hi, All I have a question that in Process Scheduling topic most of the time we need to solve the problem using Gantt chart that's a bit time consuming . So I wanted to kn...

Does Waiting Time and Response TIme remains the same in Preemptive Scheduling Algorithm???

Q.1 In round-robin scheduling there are 'n' no. of processes in ready queue and time slice is 'q' units in worst case, the interrupted process will get the CPU again afte...

Hello there, I’m studing from this book (Elmasri – Navathe, Fundamentals of Database Systems, 7th Ed), and I'm having problems understanding this definition:A schedule S ...

OS:Which process scheduling mechanism gives the optimal average waiting time and throughput, is it SJF or SRTF?Which DISK scheduling algo gives the minimum seek time is i...

Free Holes4K;8K;20K;2KProgram size2K;14K;3K;6K;10K;20K;2KTime for Execution(B.T)4 ; 10; 2; 1; 4; 1; 8Using Best Fit Allocation Policy and FCFS CPU Scheduling ...

Consider the following three processes with the arrival time and CPU burst time given in miliseconds:ProcessArrival TimeBurst Time$P_1$07$P_2$14$P_3$28The Gantt Chart for...

If inefficiency of scheduling algorithm is $\frac{Burst Time wasted}{Total Burst Time} X 100$Why do we have to multiply with 100?