written 5.7 years ago by
teamques10
★ 66k
|
•
modified 5.6 years ago
|
- First in first out
- Round-robin algorithm
- Round robin with priority:
- Shortest job first
- Non Preemptive multitasking
- Preemptive multitasking
Explanation:
1. First in first out:
- In first in first out scheduling algorithm the task which are ready to run are kept in queue and the CPU serves the task on first in first served basis.
- This scheduling algorithm is shown in fig. is very simple to implement but not well suited for most applications because it is difficult to estimate the amount of time a task has to wait for being executed .
- However this is good algorithm for an embedded system has to perform few small tasks all with small execution time.
- If there is no time critically and the number of tasks is small, this algorithm can be implemented
![enter image description here](https://i.imgur.com/eSKvYWU.jpg)