Scheduling (computing) - Operating System Scheduler Implementations

Operating System Scheduler Implementations

The algorithm used may be as simple as round-robin in which each process is given equal time (for instance 1 ms, usually between 1 ms and 100 ms) in a cycling list. So, process A executes for 1 ms, then process B, then process C, then back to process A.

More advanced algorithms take into account process priority, or the importance of the process. This allows some processes to use more time than other processes. The kernel always uses whatever resources it needs to ensure proper functioning of the system, and so can be said to have infinite priority. In SMP(symmetric multiprocessing) systems, processor affinity is considered to increase overall system performance, even if it may cause a process itself to run more slowly. This generally improves performance by reducing cache thrashing.

Read more about this topic:  Scheduling (computing)

Famous quotes containing the words operating and/or system:

    Go on then in doing with your pen what in other times was done with the sword; shew that reformation is more practicable by operating on the mind than on the body of man.
    Thomas Jefferson (1743–1826)

    Such is the remorseless progression of human society, shedding lives and souls as it goes on its way. It is an ocean into which men sink who have been cast out by the law and consigned, with help most cruelly withheld, to moral death. The sea is the pitiless social darkness into which the penal system casts those it has condemned, an unfathomable waste of misery. The human soul, lost in those depths, may become a corpse. Who shall revive it?
    Victor Hugo (1802–1885)