Process Scheduling Flashcards

(15 cards)

0
Q

One of the downsides to context switching

A

Time is spent doing this

The system does no useful work while context switching

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

What is context switch

A

When the processor switches to another process and saves the state of the old process and loads and the saved state for the new process

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

What does the scheduler do

A

Decide which process to run first

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

What are the two major classes of operating system scheduling

A

Pre-emptive and nonpreemptive

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

What is nonpreemptive scheduling

A

I’m running Process may only move to the block state by choosing to do so itself

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

What is pre-emptive scheduling

A

A process may move itself to the block state or be moved automatically by the OS

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

What are the performance measures of scheduling algorithms

A

Average response time and average turnaround time

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

What is average response time

A

The amount of time taken for all the processes in a process queue to start

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

What is the average turnaround time

A

The average time taken for all of the processes in the process queue to finish

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

What are the four scheduling algorithms

A

First-come first-served
Shortest job first
Round robin
Priority queue

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

What is first come first serve scheduling

A

When the process schedule starts the processes in the queue in order that they entered the queue

First-come first-served is a nonpreemptive algorithm

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

What is the shortest job first scheduling

A

The scheduling algorithm finds out the estimated length of each process
Processes are started in order of the shortest one first
Shortest first is a nonpreemptive algorithm

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

What is round robin scheduling

A

Each process is given a time slice
Once their time is up the next process is allowed its time slice

Preemptive algorithm

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

What is the priority queue scheduling algorithm

A

Depending on the priority of the process
Process with highest priority runs first
Priority 1 is highest priority
Processes with equal priority we use round robin

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

Try calculating the turnaround and response

A

.

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