操作系统OS201301OS201306概要1.pptx

Chapter2 Processes and Threads;2.4 Scheduling;2.4 Scheduling;2.4.1 Introduction to Scheduling;2.4.1 Introduction to Scheduling;2.4.1 Introduction to Scheduling;2.4.1 Introduction to Scheduling;2.4.1 Introduction to Scheduling;2.4.2 Scheduling in Batch Systems;2.4.2 Scheduling in Batch Systems;First-Come, First-Served (FCFS) Scheduling;FCFS Scheduling;2.4.2 Scheduling in Batch Systems;2.4.2 Scheduling in Batch Systems;Example of Non-Preemptive SJF;Example of Preemptive SJF;2.4.2 Scheduling in Batch Systems;2.4.2 Scheduling in Batch Systems;2.4.2 Scheduling in Batch Systems;CPU Scheduling;Dispatcher;2.4.3 Scheduling in Interactive Systems;2.4.3 Scheduling in Interactive Systems;2.4.3 Scheduling in Interactive Systems;2.4.3 Scheduling in Interactive Systems;2.4.3 Scheduling in Interactive Systems;Short Process Next If we regard the execution of each command as a separate “job”, then we could minimize the overall response time by running the shortest one first. Which of the current runnable processes is the shortest one? aging（老化）：a = 1/2时容易实现。;Guaranteed Scheduling To make real promises to the user about performance and then live up to them. Lottery Scheduling Give processes lottery tickets for various system resources. a lottery ticket is chosen at random when scheduling, and the process holding that ticket gets the resource. Fair-Share Scheduling each user is allocated some fraction of the CPU;Homework;Next Class;Thank You !