Bissoy.com
Doctors Medicines MCQs Q&A

One of the Scheduling method is also known as Shortest-­next­-CPU­-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here?

One of the Scheduling method is also known as Shortest-­next­-CPU­-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here? Correct Answer SJF Scheduling

The correct answer is option 1.

Concept:

Shortest job first (SJF) or shortest job next scheduling method is also known as the Shortest-­next­-CPU­-burst algorithm because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. 

  • In a non-preemptive kernel, SJF (shortest job first) is used. This means that all processes in the ready state queue are evaluated, and the one with the least wait time advances to the front of the line.
  • A preemptive kernel uses SRTF, or shortest remaining time first. If a process that is shorter than the one now executing enters the ready state queue, the kernel will preempt the current process and start the shorter process first.
  • SJF/SRTF probably optimizes minimum average wait times.  This can result in a faster overall scheduler, certainly faster than FCFS or Round Robins. 

Hence the correct answer is SJF Scheduling.

Additional Information

  • FCFS is an abbreviation for First Come, First Serve. The job that arrived first in the ready queue is assigned to the CPU by the FCFS scheduling algorithm, followed by the job that arrived second, and so on. As a process holds the CPU until it either terminates or performs I/O, FCFS is a non-preemptive scheduling algorithm.
  • Round Robin is a CPU scheduling algorithm that assigns each process a fixed time slot in a cyclic manner.
  • When processes in the ready queue can be divided into different classes, each with its own scheduling requirements, multilevel queue scheduling is used. 

Related Questions

A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is?
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is ____________
Consider four processes P, Q, R, and S scheduled on a CPU as per round-robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t = 0. There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?  
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35., can the two processes be scheduled using the EDF algorithm without missing their respective deadlines?
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. Can the processes be scheduled without missing the deadlines?
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35., the priorities of P1 and P2 are?
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Consider an arbitrary set of CPU – bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is as shown below. The objective is to find the shortest-cost path from the router R to routers P and Q. Assume that R does not initially know the shortest routes to P and Q. Assume that R has three neighbouring routers denoted as X, Y, and Z. During one iteration, R measures its distance to its neighbours X, Y, and Z as 3, 2, and 5, respectively. Router R gets routing vectors from its neighbours that indicate that the distance to router P from routers X, Y, and Z are 7, 6, and 5, respectively. The routing vector also indicates that the distance to router Q from routers X, Y, and Z are 4, 6, and 8, respectively. Which of the following statement(s) is/are correct with respect to the new routing table of R, after updation during this iteration ? 
You install and run a third-party 32-bit application named Application on your Windows 2000 Server computer. After several days, the application stops responding. You open Task Manager and find that the CPU usage is at 100 percent. The normal range of CPU usage on the server is from 20 percent to 30 percent You end the application. However, you see that the CPU on the server is still at 100 percent. Task Manager shows no other applications running. You then examine the Processes page in Task Manager and confirm that the Application.exe process is no longer running. You want to return the CPU usage to its normal range. What should you do?