Scheduling algorithims
The scheduler will need to decide when to swap a process from ready to run to running. It will also need to decide on which order processes should occur in.
There are many algoritims to consider -
| Algorithim | Description | Link |
| FCFS | First come first served. Each process will be handled as a queue. | |
| RR | Round robin. This is where each process is given a short burst of time and then done in order. | Link |
| SJF | Shortest job first - When a short process is added to the ready to run queue it will be given a higher priority over the other processes. | Link |
| SRT | Shortest remaining time - This gives priority to processes which have the least amount of time remaining. | Link |
| MFQ | Multi-level feedback queues. This is a more advanced algorithim which uses multiple queues rather than just one. | Link |
