Starvation

What is CPU Scheduling?

CPU scheduling is the OS mechanism that decides which ready process or thread gets to run on the CPU next, aiming to balance throughput, fairness, and responsi…

What is the Critical Section Problem?

The critical section problem is the challenge of designing a protocol that lets multiple concurrent processes or threads take turns using a shared resource saf…

What is Shortest-Job-First (SJF) Scheduling?

Shortest-Job-First (SJF) is a scheduling algorithm that always dispatches the ready process with the smallest total CPU burst time next, which provably minimiz…

What is Shortest-Remaining-Time-First (SRTF) Scheduling?

Shortest-Remaining-Time-First (SRTF) is the preemptive version of Shortest-Job-First: whenever a new process arrives, the scheduler compares its burst time to…

What is Priority Scheduling?

Priority scheduling dispatches the ready process with the highest priority value next, rather than by arrival order or burst time, and can be implemented as ei…

What is Multilevel Queue Scheduling?

Multilevel queue scheduling partitions the ready queue into several separate queues by process type — such as system, interactive, and batch — each with its ow…

What is Multilevel Feedback Queue Scheduling?

Multilevel feedback queue (MLFQ) scheduling uses several ready queues ranked by priority, each with its own time quantum, and moves a process between queues ba…

What is Lottery Scheduling?

Lottery scheduling is a probabilistic CPU scheduling algorithm that gives each process a number of lottery tickets proportional to its desired share of the CPU…

Round Robin vs Priority Scheduling: What is the Difference?

Round Robin gives every ready process an equal, fixed-size time slice in strict rotation regardless of importance, prioritizing fairness and responsiveness, wh…

How Does Deadlock Recovery Work?

Deadlock recovery is the set of techniques an operating system uses after a deadlock has already been detected, and it works by forcibly breaking the circular…

Deadlock vs Starvation: What Is the Difference?

Deadlock is a permanent standstill where a set of processes are each waiting on a resource held by another in the same set, so none of them can ever proceed wi…

The Readers-Writers Problem Explained

The readers-writers problem is a synchronization challenge where multiple reader threads may safely access shared data concurrently, but a writer thread must h…

The Dining Philosophers Problem Explained

The dining philosophers problem is a classic model of resource deadlock and starvation where five philosophers sit around a table sharing five forks, each need…

What is SSTF Disk Scheduling?

Shortest-Seek-Time-First (SSTF) disk scheduling always services the pending request whose cylinder is closest to the disk head’s current position, greedily min…

What is Starvation in CPU Scheduling?

Starvation is a scheduling failure where a process is repeatedly passed over in favor of other processes and, as a result, waits indefinitely and may never get…

What is Aging in CPU Scheduling?

Aging is a scheduling technique where the OS gradually increases the priority of a task the longer it waits in the ready queue, which guarantees that even a lo…