Overview & Definition (परिचय तथा परिभाषा)

Scheduling is the method by which an operating system decides which of the ready processes will be allocated the CPU at any given time. It is a core function that determines the order of execution, aiming to make efficient use of system resources while meeting user and application requirements.

Core Concepts (मुख्य अवधारणाहरू)

1. Types of Schedulers

2. Common Scheduling Algorithms

3. Performance Criteria (Factors that affect the scheduler’s performance)

Key Points / Rules / Functions

Comparison Table

Criterion Goal Typical Algorithm Emphasis Impact on Overhead
CPU Utilization Keep CPU busy FCFS, SJF, RR Low to moderate
Throughput Max processes completed per hour SJF (short jobs first) Low
Turnaround Time Minimize total time per process SJF, Priority Low to moderate
Waiting Time Reduce time in ready queue RR, Multilevel Feedback Moderate (more context switches)
Response Time Fast first response for interactive jobs RR, Priority (preemptive) Higher due to preemption
Fairness Equal CPU share for all processes RR, Multilevel Queue Moderate
Real‑time Guarantees Meet deadlines deterministically Rate‑Monotonic, EDF Potentially high (tight control)

Practical Application / Real‑world Relevance

Understanding scheduling is essential for:

Quick Review Questions & Answers (अभ्यासका लागि प्रश्नोत्तर)

  1. What is the primary purpose of a short‑term scheduler?
    To select which ready process gets the CPU next, usually within milliseconds.
  2. Which scheduling algorithm generally provides the lowest average waiting time?
    Shortest Job First (SJF) – when job lengths are known.
  3. Define ‘context switch’ and its effect on scheduler overhead.
    A context switch saves the state of the current process and loads the state of the next; it adds CPU overhead, especially in preemptive algorithms.
  4. What problem does ‘priority inversion’ describe?
    When a low‑priority process holds a resource needed by a high‑priority process, causing the high‑priority one to wait.
  5. Match the criterion with the most suitable algorithm:
    • Fast response for interactive users – Round Robin
    • Maximum throughput – SJF
    • Deterministic deadlines – Earliest Deadline First (EDF)

Use these questions to test your recall before the exam. Revisiting the table and key points will help you answer related multiple‑choice questions quickly.