Types of scheduling processes:

Long-term scheduling

once a new process is accepted (and partially created) it may enter the scheduling queues in one of two places:

—If all resources (such as memory requirements) are initially 
fully available to the new process, it may be admitted to the tail
 of the Ready queue.

—If not all resources are immediately available, the new process 
may be instantiated in the Blocked-Suspended queue until those 
resources are provided.

Medium-term scheduling

• determines when processes are to be suspended and resumed
• The medium-term scheduler runs more frequently, 
• deciding which process’s pages to swap to and from the
•  swapping device: typically once a second.

Short-term scheduling

—determines which of the ready processes can have 
CPU resources, and for how long.

—also called as the dispatcher

executes most frequently(every few hundredths of a second) making
fine-grained decisions

as to which process to move to Running next.

—is invoked whenever an event occurs

—provides the opportunity, or requires, the interruption of the

 current process and

the new (or continued) execution of another process.


BY:
NOR AQILAH BINTI KAMARUZAMAN
NURHAYATUN NISHA BT SAHARUDIN 
SHAIDATUL HIDAYU BT MOHAMMAD SABRI