《OPERATING SYSTEMS教学课件》ch2c.pptVIP

* Set Priority Two approaches Static (for system with well known and regular application behaviors) Dynamic (otherwise) Priority may be based on: Cost to user Importance of user Process type Requirement to resource Aging Percentage of CPU time used in last X hours. * Priority Scheduling: Example Process Duration Priority Arrival Time P1 6 4 0 P2 8 1 0 P3 7 3 0 P4 3 2 0 0 8 P4 (3) P1 (6) 11 P3 (7) 18 P2 waiting time: 0 P4 waiting time: 8 P3 waiting time: 11 P1 waiting time: 18 The average waiting time (AWT):  (0+8+11+18)/4 = 9.25 (worse than SJF:7) P2 (8) 24 * Priority in Unix * Be “nice”