07 - More Process Scheduling (Identification)

SJF

Shortest Job First

SRTF

Shortest Remaining Time First

p(n)

Predicted length of the nth CPU burst

t(n)

Actual measured length of the nth CPU burst

w

Weight factor for recent CPU burst history in exponential averaging

Starvation

Indefinite waiting of a process due to low priority

Aging

Gradually increasing priority of waiting processes to prevent starvation

Time quantum (q)

Fixed amount of CPU time given per process in Round-Robin

Context switch

CPU switching from one process to another

Multilevel Queue Scheduling

Multiple fixed ready queues based on process type

Multilevel Feedback Queue Scheduling

Multiple queues where processes can move between queues

SMP (Self-scheduling)

Each processor selects its own process from the queue

ASMP (Master-slave)

One processor schedules and assigns work to others

Hard real-time system

System where missing deadlines is unacceptable and must be guaranteed

Deterministic modeling

Evaluation using a fixed predetermined workload

Queuing model

Evaluation using probability distributions of CPU bursts