操作系统课件03.pdfVIP

Introduction to Operating Systems Lecture 3: Process Scheduling QIAN Weining wnqian@ Institute of Massive Computing East China Normal University Outline ● Behavior of processes ● Criteria of process scheduling ● Scheduling algorithms – FCFS – RR – SJF – SRTF – Multi-level feedback queue ● Algorithm evaluation 02/03/08 os@sei.ecnu 2 Behavior of processes ● Programs alternate between bursts of CPU and I/O 02/03/08 os@sei.ecnu 3 Criteria ● Response time ● Throughput – amount of time it takes from – # of processes that when a request was complete their execution per submitted until the first time unit response is produced, not ● Turnaround time output – amount of time to execute a ● Waiting time particular process – amount of time a process ● CPU utilization has been waiting in the ready queue – keep the CPU as busy as possible ● Fairness 02/03/08 – Share CPU among users in os@sei.ecnu 4 More words on fairness ● Shall we schedule the processes/threads for users or processes? – One user with one process and another with ten? ● Implicit assumptions: – One program per user