AOS 3

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

1/18

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 3:09 AM on 2/5/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

19 Terms

1
New cards

Policy

The ordering of which processes to run

2
New cards

Policy scheduling assumptions

  1. All procceses have the same runtime

  2. All processes arrive at the same time

  3. The processes only use the cpu, not io, gpu, display to screen

  4. We know the runtime ahead of time

3
New cards

Turnaround time

The time it takes for a process to arrive and execute

4
New cards

Throughput

The number of processes that can be executed

5
New cards

Fairness

How equally the cpu is shared between the processes

6
New cards

Responsiveness

The time between arrival and getting scheduled

7
New cards

FIFO scheduling

The first process to arrive is the first one to be executed

8
New cards

Shortest job first (SJF) policy

Whichever job has the shorted execution time, will get priority. Has good turnaround and responsiveness

9
New cards

Preemption

A feature of scheduling algorithms that allows the cpu to context switch out the current process and switch in another one for a short time.

10
New cards

Shortest Job Time Completion (Policy)

Uses preemption so any processes that show up that have a shorter ttc will be executed after context switching out the current process.

11
New cards

Completely fair scheduler

The linux task scheduler. Uses a heap to store processes, sorted by virtual runtime. Whichever has the least runtime will be run first.

12
New cards

Virtual Runtime

How much a process runs vs how much it is supposed to run. The calculation is complicated by accounting for the priority of the process, how much time it ran, how many different processes are competing for runtime. The VR is always being recomputed.

13
New cards

Linux Categories of Processes

Other, Batch, Idle

14
New cards

Batch Process

Computation bound process which needs to run without interruption as much as possible so that it can finish.

15
New cards

Idle process

The tag for processes that are running in the background and not doing too much.

16
New cards

Thread

Has its own instruction pointer, its own stack, and its own set of registers. This is different from a process.

17
New cards

What context switch is cheaper, thread or process?

The thread is cheaper since it is smaller.

18
New cards

Data race

When different processes are trying to do something in a certain order and they operate out of order.

19
New cards