Talk:Operating System Design/Processes/Scheduling

Why are there not combination scheduling discuses.

Tops-10 for example used a preemptive time sliced layered scheduling algorithm. Multiple run queues were used. Three normal priority queues and a configured number of high priority real time job queue. The highest high priority real time job got to run. These jobs were real time processes handling events. Normal jobs were in one of the normal run queues. The highest was an interactive queue. When ever a task came out of a wait state it was put on the first run queue. If it used up it time it was sent to a lower queue depending on it memory size.

What happens when a task is preempted. Should it return to the front of it's run queue.

--Steamerandy (discuss • contribs) 10:02, 27 September 2014 (UTC)