Chapter 16 Flashcards

1
Q

What is Round Robin (RR) algorithm

A

Each process gets a small unit of CPU time, called time slice or quantum, which is usually 10-100milliseconds. After this time has elapsed, the process is preempted and added to the end of the ready queue.

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

`What is context switch latency

A

The time required by a process to taken it back from process, we call this process context switch too. So time take for context switch is context switch latency.

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

What happen when quantum is large

A

process will become like First in first serve

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

What happen when quantum is small

A

Context switch latency will increase

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

What should be the context switch time

A

Context switch time should be 10% of quantum size

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

What are multilevel queues scheduling

A

We partition ready queue in multiple queues. When a process comes, it goes to any one queue. Every queue has its priority and scheduling system.

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

What are 2 types of scheduling in multiple queues

A
  1. Fixed priority scheduling: Giving absolute priority of queues. So one queue will end the processes and then focus will be shifted to another queue. This could result in starvation
  2. Time slice: We divide time for queues. In this way, there will be no starvation.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly