CPU Scheduling Flashcards

1
Q

A process under execution in the CPU that can be interrupted by other process.

A

Preemptive Scheduling

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

A process with CPU allocated to it can keep the CPU until it releases it by terminating or switching to waiting state.

A

Nonpreemptive Scheduling

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

The percentage of time the CPU is busy.

A

CPU Utilization

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

The number of process that complete their excution per time unit.

A

Throughput

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

The amount of time it takes a process to excute.

A

Turnaround Time

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

The amount of time the process spends in the ready queue.

A

Waiting Time

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

The amount of time it takes a process to produce its first response since it submitted a request.

A

Response Time

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

The processes are based on their arrival times FIFO.

A

First Come First Serve - FCFS

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

The process cannot be preempted until it completes its CPU Brust Time.

A

Nonpreemptive Shortest Job First - Nonpreemptive SFJ

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

A process is put on pause if another one with a Brust Time less than the Remaining Time of the currently executing process is requesting execution.

A

Preemptive Shortest Job First - SFJ OR Shortest Remaining Time First - SRTF

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

Each process gets a Quantum Time, after that time elapses (ends), the process is preempted and added to the end of the Ready Queue.

A

Round Robin - RR

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

Based on the Priority Number the process was assigned, it executes and cannot be preempted until it completes its CPU Brust Time.

A

Nonpreemptive Priority

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

Based on the Priority Number the process was assigned, it executes and can be preempted if a new process with a higher priority arrives.

A

Preemptive Prority

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

It is the most optimal amoung all the nonpreemptive algorithms.

A

Nonpreemptive SJF

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

It is the most optimal amoung all the preemtive algorithms.

A

Preemptive SJF (SRTF)

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

Both algorthims cannot be accuratly implemented due the fact that how long a job will run cannot be ever known for certain.

A

Nonpreemptive SFJ and Preemptive SFJ (SRTF)

17
Q

Both algorthims become the same as the FIFO algorthim when the Brust Time of the jobs (processes) is almost equal.

A

Nonpreemptive SFJ and Preemptive SFJ (SRTF)

18
Q

This algorthim could lead to starvation if many short jobs are requesting execution, large ones will almost never get the chance to excute.

A

Preemptive SFJ (SRTF)

19
Q

The algorthim behaves similarly to FIFO algorthim when the Quantum Time is very long compared to their Brust Time.

A

RR

20
Q

This algorthim has less average Response Time than FIFO algorthim when the jobs have Brust Times that are not very similar to one another.

A

RR

21
Q

This algorthim could lead to starvation if many high priority jobs are requesting execution, low priority jobs will almost never get the chance to excute.

A

Priority

22
Q

Has deparate queues, foreground and background, and each have their scheduling algorthim.

A

Ready Queue

23
Q

Priority ranges from 1 to 99.

A

Real Time Proccess in Linux

24
Q

Priority is always 0.

A

Normal Processes in Linux.

25
Q

A value used to modify the Process Priority.

A

Nice Value

26
Q

Root user can modify the process to have nice values that range from __ to __.

A

-20, 19

27
Q

Other users can modify the process to have nice values that range from __ to __.

A

0, 19