1 / 15

Task Scheduling Algorithm Simulation

This simulation illustrates a task scheduling algorithm with varying process times and states to optimize efficiency. The processes change states based on remaining time and arrival time.

ottoh
Download Presentation

Task Scheduling Algorithm Simulation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Shortest Remaining Time SRT Prepared by Ahmet Rizaner

  2. Time = 0 A

  3. Time = 1 A

  4. Remaining times: A  1 B  6 So, A will continue Time = 2 A B

  5. Time = 3 A B

  6. Remaining times: B  5 C  4 So, B goes to waiting state And C to running state Time = 4 B C

  7. Time = 5 B C

  8. Remaining times: B  5 C  2 D 5 So, C will continue. Time = 6 C D B

  9. Time = 7 C D B

  10. Remaining times: B  5 D 5 E 2 So, E is next. Time = 8 C E D B

  11. Time = 10 E D B

  12. Remaining times: B  5 D  5 In such cases, chose the first started process. (process with the smallest arrival time) Time = 10 D B

  13. Time = 15 B D

  14. Time = 20 D

  15. Prepared by Ahmet Rizaner

More Related