Skip to main content

Process Scheduling And Types of Process Schedular :-


 
      ⇰ PROCESS SCHEDULING
Process Scheduling is a task  of Operating System that schedules processes of different states like new, ready, waiting, terminated  and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time. 
⏩   Followings are some objectives of Process Scheduling :-
 i > To increase the amount of users within acceptable response times.

  ii > To maintain the balance between response and utilization of system.

 iii > To decrease the enforce priorities and give reference to the processes holding the key resources.
  
  ⇰  PROCESS SCHEDULAR
A scheduler carries out the process scheduling work. Schedulers are often implemented so they keep all computer resources busy and allows multiple users to share system resources  to achieve  multiprogramming.
 There are  mainy three types of process scheduler :-
   i > Long Term schedular.
  ii > Short Term schedular.
 iii >  Mediam Term schedular.
  
i > Long Term   :-  It is also known as Job Schedular. This schedular selects  new process  from queue and loads into memory for  execution.  It controls Degree of Multi-programming means maintains number of process present in ready state at a particular time. The main goal of this scheduler is to offer a balanced mix of jobs, like Processor, I/O jobs., that allows managing multiprogramming.


ii > Short term schedular :- This schedular is also known as CPU scheduler.  The main goal of this scheduler is to boost the system performance according to set criteria.   It is responsible for selecting one process from ready state for scheduling it on the running state. Dispatcher is responsible for loading the process selected by Short-term scheduler on the CPU. The dispatcher gives control of the CPU to the process selected by the short term scheduler.
 A dispatcher does the following works:-
∗ Switching context.
∗ Switching to user mode.
∗ Jump to the proper location in the newly loaded program.


 iii > Medium-term scheduler :-  This schedular is an important part of swapping. It enables handling the swapped out-processes.   It is responsible for suspending and resuming the process based on I/O request of process. A running process can become suspended if it makes an I/O request. A suspended processes can't make any progress towards completion. In order to remove the process from memory and make space for other processes, the suspended process should be moved to secondary storage.
Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

Process & Its state And process control block :-

                ⇰  PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution.             A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads.         The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two ...
Post a Comment
Read more

Definition of Stack and its algorithm with working process(data structure)

                  Stack                           A Stack is  an ordered collection of items where the addition of items and the removal of existing items always takes place at the same end. This end is commonly referred to as the “top". * working method of stack :- i> Initially top=-1 ii> By increasing top pointer we can insert element    in the stack. iii> when top=size of stack-1  then stack is full. iv> By decreasing the top pointer we can remove   the   element from stack. v> when top=-1 then the stack is empty. figure shows run time stack * The fundamental operations which are possible on a stack are:-         1. push operation (insertion).    2. pop operation (deletion).    3. peep opetation(extract informat...
2 comments
Read more