电子科技大学计算机操作系统课件Chapter 2 Processes and Scheduling (I).pptVIP

Chapter 2 Processes and Scheduling (I) Contents Foundation：Process Description and Control Implement： Mutual Exclusion and Synchronization Avoidance： Deadlock（死锁） and Hungry（饥饿） Solution： Several Classical(经典) Problems About： Process Communications Policy： Process scheduling Process Description and Control （p101） Concurrence (vs.parallel) execution of processes (supplement（补充）) Process states and transition Process description（PCB） Process control（Primitive/Atomic） Serial Execution of Program Serial execution characteristics Sequence（顺序）、isolate（独立）、recurrence（再现） Concurrence execution characteristics discontinuity、no-isoloate、no-recurrence Bernstein condition R(P1) ∩W(P2)∪W(P1) ∩R(P2)∪W(P1) ∩W(P2) = {Φ} Some Problems for Process Management（p101） How to dispatch（分派） CPU to multi-processes How to allocate resource to multi-processes and avoid deadlock and hungry How to implement the process communication Process Concept（p60） A program in execution The “animated spirit” of a program The entity that can be assigned to and executed on a processor Process Characteristics（Supplement） Dynamic: create-dispatch-request I/O- redispatch(重分派)-exit Concurrence： Independence：Each process does not feel the existence of other processes. Discontinuity: Architecture of Process（p120） User data and program System stack PCB，Process Control Block Process States Concurrence execution of processes States of processes（2-states、5-states） Example of Concurrence Execution(p102) An example: Three processes are fully loaded in main memory. A small dispatcher program that moves the processor from one process to another. The first 12 instruction executed in processes A and C. Process B executes four instructions and the fourth instruction invokes（激发） an I/O operation for which the process must wait. Example Figure3.2，P103 Example Figure 3.3，P104 Two State Process Model（P104） Two states Running Not-running A new process enters into the not-r