Scheduler

Scheduler

Scheduling Objectives

Here, are important objectives of Process scheduling

Maximize the number of interactive users within acceptable response times.
Achieve a balance between response and utilization.
Avoid indefinite postponement and enforce priorities.
It also should give reference to the processes holding the key resources

Process Scheduling handles the selection of a process for the processor on the basis of a scheduling algorithm and also the removal of a process from the processor. It is an important part of multiprogramming in operating system.

Process scheduling involves short-term scheduling, medium-term scheduling and long-term scheduling. Details about these are given as follows −

Long-Term Scheduling
Long-term scheduling involves selecting the processes from the storage pool in the secondary memory and loading them into the ready queue in the main memory for execution. This is handled by the long-term scheduler or job scheduler.
The long-term scheduler controls the degree of multiprogramming. It must select a careful mixture of I/O bound and CPU bound processes to yield optimum system throughput. If it selects too many CPU bound processes then the I/O devices are idle and if it selects too many I/O bound processes then the processor has nothing to do.
Short-Term Scheduling
Short-term scheduling involves selecting one of the processes from the ready queue and scheduling them for execution. This is done by the short-term scheduler. A scheduling algorithm is used to decide which process will be scheduled for execution next by the short-term scheduler.
The short-term scheduler executes much more frequently than the long-term scheduler as a process may execute only for a few milliseconds.
The choices of the short term scheduler are very important. If it selects a process with a long burst time, then all the processes after that will have to wait for a long time in the ready queue. This is known as starvation and it may happen if a wrong decision is made by the short-term scheduler.
A diagram that demonstrates scheduling using long-term and short-term schedulers is given as follows −
Medium-Term Scheduling
Medium-term scheduling involves swapping out a process from main memory. The process can be swapped in later from the point it stopped executing. This can also be called as suspending and resuming the process and is done by the medium-term scheduler.
This is helpful in reducing the degree of multiprogramming. Swapping is also useful to improve the mix of I/O bound and CPU bound processes in the memory.
A diagram that demonstrates medium-term scheduling is given as follows −

Comments

Multi user Operating System

Multi user operating system · In a multi-user operating system, multiple number of user can access different resources of a computer at a same time. · The access is provided using a network that consists of various personal computer attached to a mainframe computer system. diagram of multi -user operating system · The various personal computer can send and receive information to mainframe computer system. · The example of multi-user OS are UNIX, windows 2000,novell netware. sing...

Shortest Job First Scheduling (SJF)

Shortest Job First Scheduling (SJF) · SJF ia also known as shortest-job-next(SJN) algorithm and is faster than FCFS. · In SJF, the process with the least estimated execution time is selected from the ready queue for execution. · For this, SJF algorithm associates with each process, the length of its next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. · If tow processes have the same length of next CPU burst ,FCFS scheduling algorithm is used to break the tie. · SJF algorithm can be preemptive or non-preemptive. Non-preeptive SJF · In non-preemptive SJF, scheduling, CPU is always assigned to the ...

Scheduling Algorithms

Scheduling Algorithms CPU scheduling algorithm deal with the problem of deciding which of the processes in the ready queue is to be allocated the CPU . six commonly used scheduling algorithms are: 1. first-come First-served(FCFS) 2. Shortest job First(SJF) 3. Priority scheduling 4. Round-Robin Scheduling(RR) 5. Multi-Level Queue Scheduling(MLQ) 6. Multi-Level Feedback Queue Scheduling (MFQ) First-Come First-Served Scheduling (FCFS) · It is simplest and the most straight forward of all scheduling algorithms. · In this scheduling, the process that request the CPU first is allocated CPU first. Thus the name first come first served. · We can say that in FCFS scheduling, a process is allocated CPU time according to the arrival time of a process. · The implementation of FCFS policy is easily manged with a FIFO queue...

Exokernel architecture

Exokernel architecture Most of us know what kernels are and how do they work to make programmers’ lives easier. But, how many of us know what exokernels are? I hope you will be able to get a brief introduction on this terminology through this blog. Let’s start with a brief introduction on kernel. What is a kernel? A kernel is the foundational layer of an operating system that functions at a basic level, communicating with hardware and managing resources, such as CPU and the memory. It works as an interface between the user application and the hardware. There are two main types of kernel 1. Micro kernel 2. Monolithic Kernel 1. Monolithic architecture 2. Layerd archtecture . 3. Virtual machine architecture 4. Exokernel architecture 5. Client server architecture 6. Micro kernel architecture Now let’s head into our main focus. What is an Exokern...

Priority scheduling

Priority scheduling In priority scheduling , a priority is associated with all processes. Process are executed in sequence according to their priority. The CPU time is allocated to the process with highest priority. If the priority of two or more processes are equal than the process that has been inserted first into the ready queue is selected for execution. In other words, FCFS scheduling is performed when wo or more processes have same priority. The priorities are implemented as affixed range of numbers such as 0to 7 or 0 to 4,095. In other system, a low number indicates a high priority . in that case,a process with priority 0 is executed first. Priorities can be defined in two ways : internal or externall. ...

Easytolearn

Search This Blog