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

Thread

Thread What is Thread? A thread is a flow of execution through the process code, with its own program counter that keeps track of which instruction to execute next, system registers which hold its current working variables, and a stack which contains the execution history. A thread shares with its peer threads few information like code segment, data segment and open files. When one thread alters a code segment memory item, all other threads see that. A thread is also called a lightweight process . Threads provide a way to improve application performance through parallelism. Threads represent a software approach to improving performance of operating system by reducing the overhead thread is equivalent to a classical process. Each thread belongs to exactly one process and no thread can exist outside a process. Each thread represents a separate flow of control. Threads have been successfully used in implementing network servers and web server. They also provide a suitable foundation ...

Multi Level Queue Scheduling (MLQ)

Multi Level Queue Scheduling (MLQ) · Multilevel queue scheduling classifies the processes according to their types for example, a multilevel queue scheduling algorithm makes a common. · In this scheduling ready queue is divided into various queue that are called sub queues. A subqueue is a distinct operational queue · The process are permanently assigned to subqueues, generally based on some property of the process such as memory size,priority or process type · Each subqueue has its process sucheduling algorithm. For example interactive process at the foreground may use round robin scheduling while batch jobs at the background may use the FCFS method · For example, consider a system with four different queues 1. ...

Layered Operating System

Layered Operating System Layered Structure is a type of system structure in which the different services of the operating system are split into various layers, where each layer has a specific well-defined task to perform . It was created to improve the pre-existing structures like the Monolithic structure ( UNIX ) and the Simple structure ( MS-DOS ). Example – The Windows NT operating system uses this layered approach as a part of it . Design Analysis : The whole Operating System is separated into several layers ( from 0 to n ) as the diagram shows. Each of the layers must have its own specific function to perform. There are some rules in the implementation of the layers as follows. The outermost layer must be the User Interface layer. The innermost layer must be the Hardware layer. A particular layer can access all the layers present below it but it cannot access the layers present above it. That is layer n-1 can access all the layers from n-2 to 0 but it canno...

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...

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...

Easytolearn

Search This Blog