Scheduling Flashcards
What is FIFO scheduling and how does it work?
FIFO stands for first-in-first-out so the task that first gets put in queue is the first to be used. So tasks are running in the order they arrive.
What is Multilevel Feedback Queue (MFQ) scheduling and how does it function?
MFQ is a sophisticated CPU scheduling algorithm that uses multiple queues with varying priority levels.
Processes start in the highest priority queue and are demoted to lower priority queues if they use more CPU time than allocated in their current queue.
This dynamic adjustment allows the scheduler to prioritize shorter jobs and I/O-bound processes while still giving CPU-bound processes eventual access to the CPU.
It combines the benefits of SJF (efficient for short jobs) and RR (fair time allocation), adjusting priorities based on observed process behavior.
What is Round Robin (RR) scheduling and how does it function?
RR is a pre-emptive CPU scheduling algorithm that assigns a fixed time slice (quantum) to each process in a circular queue.
Processes are executed in the order they arrive, and each process runs for a time slice or until it completes, whichever comes first.
If a process does not finish during its time slice, it is placed at the end of the queue and waits for its next turn.
RR is known for its fairness in CPU time allocation but can be inefficient for longer tasks and does not prioritize tasks based on their length or behavior.
