W3 CPU Scheduling

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/19

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

20 Terms

1
New cards

What is CPU scheduling?

It's the process that allows one process to use the CPU while another is waiting for resources, aiming to make the system efficient, fast, and fair. In essence, CPU scheduling manages how processes share the CPU time, optimizing overall system performance, turnaround time, and resource utilization.

2
New cards

Name the 4 types of scheduling decisions.

Long-term, Medium-term, Short-term, and I/O scheduling.

3
New cards

What state transitions does Long-term scheduling handle?

From "new" to "ready" or "ready suspended".

4
New cards

What is the role of the Medium-term scheduler?

Moves processes between suspended and main memory states, managing multiprogramming.

5
New cards

What triggers the Short-term scheduler?

Events like interrupts or system calls that may reassign the CPU.

6
New cards

What are the two parts of a scheduling policy?

Selection function and Decision mode.

7
New cards

What’s the difference between preemptive and non-preemptive scheduling?

Preemptive allows interruption; non-preemptive does not interrupt running processes.

8
New cards

What is FCFS scheduling?

First-Come, First-Served; non-preemptive scheduling that executes processes in order of arrival.

9
New cards

What’s a downside of FCFS?

Poor performance for time-sharing; can starve I/O bound processes.

10
New cards

How does Round Robin scheduling work?

Processes get a fixed time slice; preemptive based on a timer.

11
New cards

What issue can Round Robin have?

Poor for I/O bound processes and sensitive to time slice size.

12
New cards

What is Shortest Process Next (SPN)?

Non-preemptive scheduling based on the shortest job time.

13
New cards

What is starvation in scheduling?

When long processes are never scheduled due to frequent arrival of shorter ones.

14
New cards

What is Shortest Remaining Time (SRT)?

Preemptive version of SPN; always chooses the process with the shortest remaining time.

15
New cards

What is Highest Response Ratio Next (HRRN)?

Non-preemptive algorithm using the formula (Wait Time + Service Time) / Service Time.

16
New cards

How does Multilevel Feedback Queue work?

Processes move between priority queues based on behavior; preemptive and dynamic.

17
New cards

What is response time?

Time from when a process joins the ready queue to when it starts executing.

18
New cards

What is turnaround time?

Time from joining the ready queue to process completion.

19
New cards

What is throughput?

Number of processes completed in a given time.

20
New cards

What are UNIX system calls for process management?

fork(), execv(), and wait().