Scheduling

Question 1

First job to arrive is ran. Arriving job put onto queue and ran in order of arrival. If running process blocks, switch to next process

Answer 1

First-Come-First-Serve

Question 1

Given a queue of jobs at some time, pick job that runs for shortest amount of time. Optimal solution

Answer 1

Shortest job first

Question 2

Pick process with least remaining runtime. If new job arrives with shorter runtime, switch to it

Answer 2

Shortest remaining time next

Question 3

Each process assigned a time interval, called quantum, to run in. Each quantum switches the current process

Answer 3

Round robin

Question 4

Quantums can be too short, causing excessive switching, or too long, wasting extra time

Answer 4

Round robin issues

Question 5

Run each process with highest priority first. RR each quantum if shared priority.

Answer 5

Priority scheduling

Question 6

Use weighted average to estimate a job runtime.

Answer 6

Shortest process next

Question 7

aT_0 + (1 - a)T_1

Answer 7

Shortest process next weight average

Question 8

Requires knowing past behaviors of running

Answer 8

Shortest process next

Question 9

Assign higher number of tickets to process with higher priority

Answer 9

Lottery scheduling