Scheduling Intro Qs Flashcards

Chapter 7 of Operating Systems: Three Easy Pieces

1
Q

How does FIFO scheduling determine which process gets the CPU next?

A

in the order they arrive

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

What is the main disadvantage of FIFO scheduling?

A

the convoy effect, a long-running process can block shorter processes behind it

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

How does SJF scheduling decide which process to execute next?

A

selects shortest estimated runtime or burst time

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

In what type of environment is SJF not ideal?

answer and then reason

A

where processes are unpredictable since it relies on knowing or estimating job lengths in advance

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

What is the key difference between SJF and STCF?

A

Preemption. SJF isn’t preemptive while STCF is. STCF can interrupt a running process if a new process with a shorter remaining time arrives

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

How does Round Robin scheduling work?

positive and negative

A

Assigns each process a time quanta and cycles through the ready queue. If a process doesn’t finish within its time quanta, it is preempted and moved to the back of the queue

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

What is the key parameter in Round Robin scheduling?

answer and then why

A

time quanta, determines how long each process can run before being preempted

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