190 likes | 248 Vues
Shortest Remaining Time SRT. Prepared by Ahmet Rizaner. Time = 0. A. Time = 1. A. Remaining times: A 1 B 6 So, A will continue. Time = 2. A. B. Time = 3. A. B. Remaining times: B 5 C 4 So, B goes to waiting state And C to running state. Time = 4. B. C.
E N D
Shortest Remaining Time SRT Prepared by Ahmet Rizaner
Time = 0 A
Time = 1 A
Remaining times: A 1 B 6 So, A will continue Time = 2 A B
Time = 3 A B
Remaining times: B 5 C 4 So, B goes to waiting state And C to running state Time = 4 B C
Time = 5 B C
Remaining times: B 5 C 2 D 5 So, C will continue. Time = 6 C D B
Time = 7 C D B
Remaining times: B 5 D 5 E 2 So, E is next. Time = 8 C E D B
Time = 10 E D B
Remaining times: B 5 D 5 In such cases, chose the first started process. (process with the smallest arrival time) Time = 10 D B
Time = 15 B D
Prepared by Ahmet Rizaner