Lecture_13-CSCIU511-Jahangir_Majumder-Spring_2025

What does FCFS stand for in scheduling algorithms?

First Come, First Served

What is the main disadvantage of the FCFS scheduling method?

Long jobs can delay every subsequent job.

What is the Shortest Job First (SJF) scheduling algorithm’s goal?

To execute the task that has the shortest remaining amount of work first.

What is the preemptive form of SJF called?

Shortest Remaining Time First (SRTF)

What defines Round Robin (RR) scheduling?

It assigns a fixed time quantum to each process in a cyclic order.

What is a key issue in selecting a time quantum for Round Robin scheduling?

If too short, too many context switches occur; if too long, response to interactive requests is delayed.

What is the effect of starvation in scheduling algorithms?

Longer processes may be indefinitely delayed if shorter processes keep arriving.

What is Max-Min Fairness in scheduling?

It aims to maximize the minimum allocation given to a task to ensure fairness.

How does priority scheduling work?

Processes are assigned priorities, and the highest priority process is allowed to run.

What is the main advantage of Multi-level Feedback Queue (MFQ)?

It provides responsiveness for short tasks, low overhead, and fairness among equal priority tasks.

How does FIFO handle tasks of different sizes?

FIFO has poor average response time if tasks are variable in size, but is optimal if tasks are equal in size.

What is one potential problem when using MFQ on a multiprocessor system?

Contention for a central scheduler spinlock can become a bottleneck.

What is the benefit of per-processor affinity scheduling?

It maximizes cache reuse by keeping threads on the same processor they most recently ran on.

What happens to processor allocation in oblivious scheduling?

Each processor time-slices its ready list independently of others, which can lead to uneven resource distribution.