Criteria against various scheduling policies that may be evaluated

Question 1

The interval of time between the submission of a process and its completion. This involves the time spent waiting in the ready queue, plus the actual execution time, plus the time spent waiting for resources, including the processor.

Formula: Turnaround Time = Finish Time - Arrival Time

Answer 1

Turnaround time

Question 2

The time from the submission of a request until the response begins to be received. In most cases, a process begins producing some output to the user while continuing to process the request.

Answer 2

Response time

Question 3

The amount of time required for a process to be executed by the CPU. This creation is also called the execution time or running time

Answer 3

Burst time

Question 4

The scheduling algorithm also affects the amount of time that a process spends waiting in the ready queue.

This is the sum o fthe periods spent waiting in the ready queue.

Formula: Waiting Time = Turnaround Time - Burst Time

Answer 4

Waiting time

Question 5

The scheduling algorithm should attempt to maximize the number of processes completed per unit of time. This is the measure of how much work is being performed by the processor.

Answer 5

Throughput

Question 6

The percentage of time that the processor is busy. For exclusive shared systems, this criterion is significant. In other systems, including single-user systems, this criterion is less important.

Conceptually, processor utilization can range from 0 to 100 percent.

Answer 6

Processor utilization

Question 7

The process priority can be modified dynamically by the schedule to improve the performance of certain workloads.

Note that when processes are assigned with specific priorities, the scheduling algorithm should favor higher-priority processes.

Answer 7

Priority

Question 8

In the absence of guidance from the user or other system-supplied guidance, processes should be treated the same, and no process should suffer from starvation

Answer 8

Fairness

Question 9

The scheduling algorithm should keep the resources of the system busy. Processes that will underutilize stressed resources should be favored.

Answer 9

Resource balancing

Question 10

This includes applications that perform heavy compute operations, such as scientific and mathematical analysis, which are expected to have long runtimes

Answer 10

CPU-bound

Question 11

This includes applications that perform input/output operations, such as web servers, file servers, and interactive shells, where low-latency responses are desirable

Answer 11

I/O bound