Register

GO Classes DPP | GATE CS | Operating System | LJF & LRTF Scheduling

281 views
4 4 votes

Which of the following statements are correct?

  1. LJF is a non-preemptive scheduling policy that selects the ready job with the largest original CPU burst.
     
  2. LRTF is a preemptive scheduling policy that selects the process having the largest remaining processing time.
     
  3. In LJF, if a new process with a larger burst time arrives, it immediately preempts the currently running process.
     
  4. LRTF always selects the process with the smallest remaining CPU burst.

2 Answers

0 0 votes

Statement (A) is correct.

LJF selects the job having the largest original size or burst time.

It is non-preemptive. Once a process begins execution, it is not interrupted merely because a larger job arrives.

Statement (B) is correct.

LRTF, called LRPT in the source, gives preemptive priority to the process with the largest remaining processing time.

Statement (C) is incorrect.

LJF is non-preemptive. A newly arriving larger process does not preempt the currently executing process.

Statement (D) is incorrect.

Selecting the smallest remaining burst corresponds to SRTF.

LRTF does the opposite and selects the largest remaining time.

0 0 votes
A, B are correct
C-> LJF is non-preemptive scheduling process.
D-> LRTF selects the Longest remaining Burst Time, not smallest
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | GAT...Next → · GO Classes DPP | GAT...
← Previous in category · GO Classes DPP | GAT...Next in category → · GO Classes DPP | GAT...
Position:
Show:

Related questions

6 6 votes
2 2 answers
277
277 views
GO Classes asked Jul 22
277 views
GO Classes DPP | GATE CS | Operating System | Priority Scheduling
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...
4 4 votes
4 4 answers
267
267 views
GO Classes asked Jul 22
267 views
GO Classes DPP | GATE CS | Operating System | SRTF Scheduling
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 ...
3 3 votes
3 3 answers
228
228 views
GO Classes asked Jul 22
228 views
GO Classes DPP | GATE CS | Operating System | Scheduling
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 \\...
1 1 vote
1 1 answer
219
219 views
GO Classes asked Jul 20
219 views
GO Classes DPP | GATE CS | Operating System | FCFS & SJF Scheduling
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...