scheduling algorithms Flashcards
1
Q
first come first serve
A
processers are executed in the order they arrive
2
Q
shortest job first
A
picks the process that takes the shortest amount of time
3
Q
round robin
A
each process is giving a slice , fixed amount of time then moves on
4
Q
shortest time remaining
A
similar to shortest job first but , pre emptive so more important jobs can take over
5
Q
multi level feeback que
A
use of multiple cores for scheduling
6
Q
what is an interrupt
A
signal sent by the cpu to show another process is in need of processing time
