Wait time
	sum of all the time that all the processes wait for the cpu


Throughput
	# jobs / unit time

Preemption
	removing invelentaily a process from the cpu

Aging
	prioity increase due to excess waiting

Starvation
	no cpu none none

Priority Inversion
	a high prioity task waiting on a resouce held by a 
	low priority task


FCFS (McDonalds Queue FiFo)
	no starv if no infinite loops
	probably fair
	easy to implement
	not optimal wait times
	no preemption
	Windows 3.X, MacOS 9

Round Robin
	no starv.
	FCFS with preemption
	probably fair
	not omptimal wait times
	

Shortest Job Next
	cpu burst shortest first
	hard part:  knowing length
	optimal wait time
	starving
	
Shortest Job Next with preemption
	it is SJN where even smaller jobs postpone small jobs
	otherwise same

Longest Job Next (with preemption)
	pessimal at wait times
	suckkkkky

Real Time Schedulers
	shortest deadline next is optimal IF it can be done
	priority inversion solved by priority inheritunce

How to detect interactive vs compute bound
	finish your cpu slide = cpu bound
	

Multi-level feedback quiz


Completely fair