CPU Scheduling

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/14

flashcard set

Earn XP

Description and Tags

These flashcards cover key vocabulary and concepts related to CPU scheduling from the operating systems lecture.

Last updated 3:51 PM on 4/2/25
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

15 Terms

1
New cards

CPU Scheduling

The method by which an operating system decides which process in memory is to be given access to the CPU.

2
New cards

Multiprogramming

The objective of multiprogramming is to maximize CPU utilization by selecting and running one process from the ready queue when the CPU is available.

3
New cards

CPU-bound Process

A process that spends more time using the CPU than waiting for I/O.

4
New cards

I/O-bound Process

A process that spends more time waiting for I/O than using the CPU.

5
New cards

Short Term Scheduler (STS)

Also known as the CPU scheduler, it selects one of the processes in memory ready for execution and allocates the CPU to it.

6
New cards

Preemptive Scheduling

A type of scheduling where a process can be interrupted and moved back to the ready state before it has finished executing.

7
New cards

Non-preemptive Scheduling

A type of scheduling where once a process is allocated the CPU, it runs until it releases the CPU either by terminating or by switching to the waiting state.

8
New cards

Turnaround Time

The total time taken from the submission of a process to the completion of the process.

9
New cards

Waiting Time

The total time a process has been waiting in the ready queue.

10
New cards

Dispatcher

The module that gives control of the CPU to the process selected by the short-term scheduler.

11
New cards

Round Robin Scheduling

Each process gets a small unit of CPU time (time quantum), after which it is preempted and added to the end of the ready queue.

12
New cards

Multilevel Queue Scheduling

A scheduling algorithm where the ready queue is partitioned into separate queues and each queue has its own scheduling algorithm.

13
New cards

Multilevel Feedback Queue Scheduling

A process can move between different queues based on its behavior and requirements, serving as a means to prevent starvation.

14
New cards

Guaranteed Scheduling

Makes real promises to users about performance, e.g., ensuring each user gets a defined share of CPU time.

15
New cards

Completely Fair Scheduler (CFS)

A Linux scheduling algorithm that aims to balance CPU time among processes based on their priority and nice value.