> Computer and Education > courses > university courses > undergraduate courses > Operating System > ZSTU class(2019-2020-1) > student directories > 2017329621060 金晟宇 >| homework 3 Version 0 |
|
| 👤 Author: by 1842906413qqcom 2019-09-21 03:40:03 | |
Q:design your example and give computation results of several cpu schedulers
| process | arrival time | burst time | priority |
|---|---|---|---|
| P1 | 4 | 10 | 2 |
| P2 | 3 | 3 | 4 |
| P3 | 2 | 2 | 5 |
| P4 | 0 | 2 | 3 |
| P5 | 1 | 5 | 1 |
1.First-Come First-Served Scheduling
average waiting time = (0+(2-1)+(7-2)+(9-3)+(12-4))/5 = 4.0ms
2.Shortest-Job-First Scheduling
average waiting time = (0+(2-2)+(4-3)+(7-1)+(12-4))/5 = 3.0ms
3.Shortest-Remaining-Time-First Scheduling
average waiting time = (0+(2-2)+(4-3)+(7-1)+(12-4))/5 = 3.0ms
4.Priority Scheduling
average waiting time = (0+(6-4)+(16-0)+(18-3)+(21-2))/5 = 10.4ms
5.Round-Robin Scheduling
let the circle is 3 millionseconds
average waiting time = (0+(2-1)+(5-3)+(7-5)+(9-3)+(12-4))/5 = 3.8ms
Please login to reply. Login