Scheduling in Windows

Scheduling in Windows

Introduction

In computer science, scheduling is termed as the method by which processes, data flows, or threads are given access to system resources (e.g. communications bandwidth and processor time). In order to achieve a target quality of service and balance the load of the system scheduling is usually done effectively (Dorndorf, 2002).

In an operating system, a deadlock is the name given to a situation which is occurred with the entrance of a process into a waiting state because a resource that it requests is held by another waiting process, which is waiting for another resource in turn. In such a situation, when it is not possible for a process to change its state indefinitely because another waiting process used the resources that were requested by it, then this system is referred to as deadlock.

Discussion

For performing multitasking by the most modern systems the requirement for a scheduling algorithm arises. It helps to execute multiple processes simultaneously and to convey more than one flow at a time (Dorndorf, 2002).

Methods of Scheduling in Windows

There are three different methods of scheduling in windows:

Long-term Scheduling

The long-term is also called admission scheduler; it helps in deciding the processes or jobs that are required to be admitted in the Main Memory. This means whenever it is tried to execute a program, its admittance with the sequence of existing processes must be certified or in other case it is deferred with this scheduler. In order to ensure that real time processes have sufficient CPU time for accomplishing their tasks, long-term scheduling is used in modern operating systems. Modern GUI interfaces would seem slow with the absence of appropriate real time scheduling. The long term remains in the Virtual Memory or in the Hard Disk (Dorndorf, 2002).

Medium-term Scheduling

The function of medium-term scheduler is to temporarily remove ...