Scheduling (OCR A-Level Computer Science): Flashcards

📚Flashcards
Scheduling
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

15 cards from this deck

Show

Function of scheduling in OS

Manages allocation of CPU time to tasks

CPU execution limitation

Can only execute one task at a time

How Round Robin allocates CPU time

Fixed time slice per task in cyclic order

Term for fixed time slice in Round Robin

Quantum

Best use for Round Robin scheduling

Time-sharing or interactive systems

How FCFS schedules tasks

In the order they arrive

FCFS task interruption behaviour

Runs to completion without interruption

Convoy effect in FCFS

Short task stuck behind long one, increasing wait time

Multi-Level Feedback Queue structure

Multiple queues with different priority levels

Task priority movement in Multi-Level Feedback Queue

Starts in high-priority queue, moves to lower-priority if unfinished

How SJF schedules tasks

Based on shortest estimated execution time

SJF preemption type

Non-preemptive

SRT preemption type

Preemptive

How SRT schedules tasks

Runs task with shortest remaining execution time

Process starvation definition

Task ignored indefinitely

Join 100,000+ A-Level students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.