Waiting Time
Everything on SkillVeris tagged Waiting Time — collected across the glossary, study notes, blog, and cheat sheets.
6 resources across 1 library
Interview Questions(6)
What is First-Come-First-Served (FCFS) Scheduling?
First-Come-First-Served (FCFS) is a non-preemptive CPU scheduling algorithm that runs processes strictly in the order they arrive in the ready queue, giving ea…
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…
Waiting Time vs Response Time in Scheduling
Waiting time is the total time a process spends sitting in the ready queue without running, while response time is the time from when a process arrives until i…
What is the Convoy Effect in CPU Scheduling?
The convoy effect is a performance problem in First-Come-First-Served scheduling where a single long-running process at the front of the ready queue forces eve…
What Metrics Are Used to Evaluate a CPU Scheduling Algorithm?
CPU scheduling algorithms are compared using five core metrics — CPU utilization, throughput, turnaround time, waiting time, and response time — and no single…