CPU scheduling algorithms (OS micro deck 7) Flashcards

(6 cards)

1
Q

first-come, first-served

A

a CPU scheduling algorithm that processes requests in the order they arrive without priority

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

shortest job next

A

a CPU scheduling algorithm that selects the process with the shortest expected execution time next

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

round-robin

A

a CPU scheduling algorithm where each process is assigned a fixed time slice in a rotating order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

preemptive scheduling

A

a CPU scheduling method where a running process can be interrupted and replaced by another process before it finishes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

non-preemptive scheduling

A

a CPU scheduling method where a running process is not interrupted and is allowed to finish before another process starts

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

a fixed amount of CPU time allocated to each process in a round-robin scheduling algorithm

A

Time slice

How well did you know this?
1
Not at all
2
3
4
5
Perfectly