1 / 23

Uniprocessor Scheduling II

Uniprocessor Scheduling II. Chapter 9. 5. 0. 10. 15. 20. 1. 2. 3. 4. 5. Shortest Process Next. Nonpreemptive policy Process with shortest expected processing time is selected next Short process jumps ahead of longer processes. P3: 4 time units P4: 5 time units P5 2 time units.

ova
Download Presentation

Uniprocessor Scheduling II

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. Uniprocessor Scheduling II Chapter 9

  2. 5 0 10 15 20 1 2 3 4 5 Shortest Process Next • Nonpreemptive policy • Process with shortest expected processing time is selected next • Short process jumps ahead of longer processes P3: 4 time units P4: 5 time units P5 2 time units

  3. Shortest Process Next • Predictability of longer processes is reduced • If estimated time for process not correct, the operating system may abort it • Possibility of starvation for longer processes

  4. 5 0 10 15 20 1 2 3 4 5 Shortest Remaining Time • SRT is a preemptive version of shortest process next (SPN) policy • Must estimate processing time P2 Remaining 5 time units P4 Remaining 5 time units P5 Remaining 2 time units P2 Remaining 5 time units P3 Remaining 4 time units

  5. 5 0 10 15 20 Highest Response Ratio Next (HRRN) • Choose next process with the greatest value of RR • No Preemptive P5 RR =3.5 1 P4 RR = 2.4 2 3 P3 RR=2.25 P4 RR = 1.6 P5 RR = 1.5 4 5 RR =(w+s)/s =time spent waiting+expected service time expected service time P5 RR=( (13-8) + 2)/2 = 3.5 // P5 has been chosen at 13 P4 RR=( (13-6) + 5)/5 = 2.4

  6. Feedback • Scheduling is done on a preemptive basis, and a dynamic priority mechanisms is used. • When s process first enters the system, it is placed in RQ0. After its first execution, when it returns to the Ready state, it is placed in RQ1.

  7. 5 0 10 15 20 1 2 3 4 5 Feedback (q = 1) • Penalize jobs that have been running longer. Focus on the time spent in execution so far. • Don’t know remaining time process needs to execute 0 1 RQ5 3 4 5 2 0 1 3 2 0 1 3 4 2 RQ4 0 1 0 1 RQ2 RQ3 RQ0 RQ1

  8. 5 0 10 15 20 Feedback q=2i • When a process first enters the system, it is placed in RQ0. After its first execution, when it returns to the Ready state, it is placed in RQ1 …… • In general, a process scheduled from RQi is allowed to execute 2 i time units (1, 2, 4, 8, …...) before preemption. RQ2, 4 time units 0 1 RQ1,2 time units 1 0 1(2) 2 2(4) 0 1(2) 3 2 0 1(2) 4 2 0 1 5

  9. Question - Case Study (1) • Consider the following set of processes: Process Name Arrival Time Processing Time 1 0 3 2 1 5 3 3 2 4 9 5 5 12 5 Perform the analysis of a comparison of scheduling policies(FCFS, RR(q=1), RR(q=4), SPN, SRT, HRRN, Feedback(q=1), and Feedback(q=2 i) )

  10. Solution of Question (2) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 FCFS 1 1 1 2 2 2 2 2 3 3 4 4 4 4 4 5 5 5 5 5 RR 1 2 1 2 3 1 2 3 2 4 2 4 5 4 5 4 5 4 5 5 q=1 RR 1 1 1 2 2 2 2 3 3 2 4 4 4 4 5 5 5 5 4 5 q=4 SPN 1 1 1 3 3 2 2 2 2 2 4 4 4 4 4 5 5 5 5 5 SRT 1 1 1 3 3 2 2 2 2 2 4 4 4 4 4 5 5 5 5 5 HRRN 1 1 1 2 2 2 2 2 3 3 4 4 4 4 4 5 5 5 5 5 FB 1 2 1 3 2 3 1 2 2 4 2 4 5 4 5 4 5 4 5 5 q=1 FB 1 2 1 1 3 2 2 3 2 2 4 4 5 4 4 5 5 4 5 5 q=2i * Each square represents one time unit. The number refers to the running process

  11. Solution of Question - FCFS(3) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 FCFS 1 1 1 2 2 2 2 2 3 3 4 4 4 4 4 5 5 5 5 5 * Each square represents one time unit. The number refers to the running process First Come First Served (FCFS) Process Pi 1 2 3 4 5 Average Arrival Time Ta 0 1 3 9 12 Service Time Ts 3 5 2 5 5 Finish Time Tf 3 8 10 15 20 Turnaround Time Tq 3.0 7.0 7.0 6.0 8.0 6.20 Tq = Tf - Ta Normalized Tq/Ts 1.0 1.4 3.5 1.2 1.6 1.74 Turnaround Time

  12. Solution of Question Round Robin q=1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 P1 P2 P3 P4 P5 1 2 1 2 3 1 2 3 2 4 2 4 5 4 5 4 5 4 5 5 Ready Time 1 3 0 2 4 7 1 9 3 5 10 12 14 9 16 13 15 12 17

  13. Solution of Question - RR (q=1)(4) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 RR 1 2 1 2 3 1 2 3 2 4 2 4 5 4 5 4 5 4 5 5 q=1 * Each square represents one time unit. The number refers to the running process Round Robin (RR q=1) Process Pi 1 2 3 4 5 Average Arrival Time Ta 0 1 3 9 12 Service Time Ts 3 5 2 5 5 Finish Time Tf 6 11 8 18 20 Turnaround Time Tq 6 10 5 9 8 7.6 Tq = Tf - Ta Normalized Tq/Ts 2.0 2.0 2.5 1.8 1.6 1.98 Turnaround Time

  14. Solution of Question Round Robin q=4 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 P1 P2 P3 P4 P5 1 1 1 2 2 2 2 3 3 2 4 4 4 4 5 5 5 5 4 5 Ready Time 0 1 7 3 9 14 12 18

  15. Solution of Question - RR (q=4)(5) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 RR 1 1 1 2 2 2 2 3 3 2 4 4 4 4 5 5 5 5 4 5 q=4 * Each square represents one time unit. The number refers to the running process Round Robin (RR q=4) Process Pi 1 2 3 4 5 Average Arrival Time Ta 0 1 3 9 12 Service Time Ts 3 5 2 5 5 Finish Time Tf 3 10 9 19 20 Turnaround Time Tq 3 9 6 10 8 7.20 Tq = Tf - Ta Normalized Tq/Ts 1.0 1.8 3.0 2.0 1.6 1.88 Turnaround Time

  16. Solution of Question - SPN(6) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 SPN 1 1 1 3 3 2 2 2 2 2 4 4 4 4 4 5 5 5 5 5 * Each square represents one time unit. The number refers to the running process Shortest Process Next (SPN) Process Pi 1 2 3 4 5 Average Arrival Time Ta 0 1 3 9 12 Service Time Ts 3 5 2 5 5 Finish Time Tf 3 10 5 15 20 Turnaround Time Tq 3 9 2 6 8 5.60 Tq = Tf - Ta Normalized Tq/Ts 1.0 1.8 1.0 1.2 1.6 1.32 Turnaround Time

  17. Solution of Question - SRT(7) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 SRT 1 1 1 3 3 2 2 2 2 2 4 4 4 4 4 5 5 5 5 5 * Each square represents one time unit. The number refers to the running process Shortest Remaining Time (SRT) Process Pi 1 2 3 4 5 Average Arrival Time Ta 0 1 3 9 12 Service Time Ts 3 5 2 5 5 Finish Time Tf 3 10 5 15 20 Turnaround Time Tq 3 9 2 6 8 5.60 Tq = Tf - Ta Normalized Tq/Ts 1.0 1.8 1.0 1.2 1.6 1.32 Turnaround Time

  18. Solution of Question - HRRN(8) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 HRRN 1 1 1 2 2 2 2 2 3 3 4 4 4 4 4 5 5 5 5 5 * Each square represents one time unit. The number refers to the running process Highest Response Ratio Next (HRRN) Process Pi 1 2 3 4 5 Average Arrival Time Ta 0 1 3 9 12 Service Time Ts 3 5 2 5 5 Finish Time Tf 3 8 10 15 20 Turnaround Time Tq 3 7 7 6 8 6.20 Tq = Tf - Ta Normalized Tq/Ts 1.0 1.4 3.5 1.2 1.6 1.74 Turnaround Time * At time 3: P2 RR (2+5)/5 = 1.4; P3 RR= (0+2)/2 = 1. So Choose P2

  19. Solution of Question Feedback q=1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 P1 P2 P3 P4 P5 1 2 1 3 2 3 1 2 2 4 4 4 5 5 5 2 4 5 4 5 RQ1 RQ2 1 0 2 1 0 2 3 RQ3 1 0 3 4 0 1 2 RQ4 RQ0 4 0 1 2 3

  20. Solution of Question - FB q=1(9) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 FB 1 2 1 3 2 3 1 2 2 4 4 4 5 5 5 2 4 5 4 5 q=1 * Each square represents one time unit. The number refers to the running process Feedback (FB q=1) Process Pi 1 2 3 4 5 Average Arrival Time Ta 0 1 3 9 12 Service Time Ts 3 5 2 5 5 Finish Time Tf 7 16 6 19 20 Turnaround Time Tq 7 15 3 10 8 8.6 Tq = Tf - Ta Normalized Tq/Ts 2.3 3.0 1.5 2.0 1.6 2.08 Turnaround Time

  21. Solution of Question Feedback q= 2i 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 P1 P2 P3 P4 P5 1 2 1 1 3 2 2 3 2 2 4 4 5 4 4 5 5 4 5 5 RQ1 1 RQ2 0 1 2 0 0 1 0 1 2 RQ0 0 1 2

  22. Solution of Question - FB q= 2i(10) 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 FB 1 2 1 1 3 2 2 3 2 2 4 4 5 4 4 5 5 4 5 5 q=2i * Each square represents one time unit. The number refers to the running process Feedback (FB q = 2i) Process Pi 1 2 3 4 5 Average Arrival Time Ta 0 1 3 9 12 Service Time Ts 3 5 2 5 5 Finish Time Tf 4 10 8 18 20 Turnaround Time Tq 4 9 5 9 8 7.00 Tq = Tf - Ta Normalized Tq/Ts 1.3 1.8 2.5 1.8 1.6 1.81 Turnaround Time

  23. Question 1 - Exercise/Home Work (1) • Consider the following set of processes: Process Name Arrival Time Processing Time 1 0 1 2 1 9 3 2 1 4 3 9 Perform the analysis of a comparison of scheduling policies(FCFS, RR(q=1), RR(q=4), SPN, SRT, HRRN, Feedback(q=1), and Feedback(q=2 i) )

More Related