Scheduling Policy

The scheduling algorithm of traditional Unix operating systems must fulfill several conflicting objectives: fast process response time, good throughput for background jobs, avoidance of process starvation, reconciliation of the needs of low- and high-priority processes, and so on. The set of rules used to determine when and how to select a new process to run is called scheduling policy.

Linux scheduling is based on the time-sharing technique already introduced in Section 6.3: several processes run in "time multiplexing" because the CPU time is divided into "slices,"

one for each runnable process.^1- Of course, a single processor can run only one process at any given instant. If a currently running process is not terminated when its time slice or quantum expires, a process switch may take place. Time-sharing relies on timer interrupts and is thus transparent to processes. No additional code needs to be inserted in the programs to ensure CPU time-sharing.

Continue reading here: [1 Recall that stopped and suspended processes cannot be selected by the scheduling algorithm to run on the CPU

Was this article helpful?

0 0