Question

What is scheduling? Explain.

Answer 1

Scheduling is a method that is used to distribute valuable computing resources, usually processor time, bandwidth and memory, to the various processes, threads, data flows and applications that need them.

Answer 2

Techopedia explains Scheduling

Scheduling in a system is done by the aptly named scheduler, which is mainly concerned with three things:

Throughput, or how fast it can finish a certain number of tasks from beginning to end per unit of time

Latency, which is the turnaround time or the time it takes to finish the task from the time of request or submission until finish, which includes the waiting time before it could be served

Response time, which is the time it takes for the process or request to be served, in short the waiting time

Scheduling is largely based on the factors mentioned above and varies depending on the system and the programming of the system's or user's preferences and objectives. In modern computers such as PCs with large amounts of processing power and other resources and with the ability to multitask by running multiple threads or pipelines at once, scheduling is no longer a big issue and most times processes and applications are given free reign with extra resources, but the scheduler is still hard at work managing requests.

Types of scheduling include:

First come, first served — The most straightforward approach and may be referred to as first in, first out; it simply does what the name suggests.

Round robin — Also known as time slicing, since each task is given a certain amount of time to use resources. This is still on a first-come-first-served basis.

Shortest remaining time first — The task which needs the least amount of time to finish is given priority.

Priority — Tasks are assigned priorities and are served depending on that priority. This can lead to the starvation of the least important tasks as they are always preempted by more important ones.