yvsou.com

1.First-Come,First-ServedScheduling

process	Burst time
P1	24
P2	3
P3	3

Turnaround Time = (0+24+23)/3 = 17

2.Shortest-Job-First（SJF）

Process	Arrival time	Burst time
P1	0	7
P2	2	4
P3	4	1
P4	5	4

Time = (0+6+3+7)/4 = 4

3.ShortestRemaining

Process	Arrival time	Burst time
P1	0	7
P2	2	4
P3	4	1
P4	5	4

Time = (9+1+0+2)/4 = 3

4.PriorityScheduling

Each process has a priority number, usually an integer.

Select the process with the highest priority in the ready queue.(minimum priority = highest priority)

（1）Preemptive（2）Nonpreemptive

The SJF algorithm is the priority method when priority is defined as the "CPU time required" by the process.

homework - 3 Version 0
👤 Author: by 1258995450qqcom 2019-09-25 14:38:59

Reversion History