Show More Ask Question

1 Answer

Answer :

The scheduler is very important in Real-Time Operating System (RTOS). Selection of tasks for execution is provided by the scheduler. Which task to execute when it is provided by the scheduler.There are different types of the scheduling algorithm. Preemptive scheduling, Round-robin scheduling, cooperative scheduling are the types of scheduling algorithms. Mostly developer uses these algorithms but if needed Developer can create own custom scheduling algorithm.


Comparision between preemptive and non-preemptive scheduling:


If the process is running and a new process with high priority come to the processor the preemptive scheduling force the running process to remove and run the process with high priority. This is not the case in non-preemptive scheduling, in non-preemptive scheduling the processor does not remove the process until it completes the process.

In case of preemptive scheduling, the operating system has control to the processor in running state of the process. But, in case of non-preemptive scheduling once the process in the processor is in running state the operating system has no control over the processor.

"First come first served" is the type of non-preemptive scheduling. "Round-robin scheduling" is the type of preemptive scheduling.

Preemptive scheduling is not simple. Non-preemptive scheduling is simple.

Preemptive scheduling is flexible while non-preemptive scheduling is rigid.

Like 0 like
Next Page →

Related

Description : what are the significance of kernel in RTOS ?

Answer : In every RTOS there is the kernel. The kernel is the core supervisory software. The kernel provides minimal logic. Scheduling is also provided by the kernel. The resource- ... device managment service.RTOS kernel has interrupt management service.RTOS kernel has memory management service.

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Answer : (A) 3

Description : Linux operating system uses (A) Affinity Scheduling (B) Fair Preemptive Scheduling (C) Hand Shaking (D) Highest Penalty Ratio Next

Answer : (B) Fair Preemptive Scheduling Explanation: Linux uses two process-scheduling algorithms: 1. A time-sharing algorithm for fair preemptive scheduling between multiple processes 2. A real-time algorithm for tasks where absolute priorities are more important than fairness

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Answer : (B) Round Robin Scheduling