MODERN OPERATING SYSTEMS Third Edition ANDREW S ...资料.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Multi-Level FeedBack Queues Multiple levels of priority Each level is run round-robin If process has to be preempted, moves to worse priority. What kind of process should be in bottom queue? * Lottery Scheduling Each runable entity is given a certain number of tickets. The more tickets you have, higher your odds of winning. Trade tickets? Problems? * Fair Share Scheduler Schedule not only based on individual process, but processs owner. N users, each user may have different # of processes. Does this make sense on a PC? Figure 2-42. A scheduling algorithm with four priority classes. Priority Scheduling Figure 2-43. (a) Possible scheduling of user-level threads with a 50-msec process quantum and threads that run 5 msec per CPU burst. Thread Scheduling Figure 2-43. (b) Possible scheduling of kernel-level threads with the same characteristics as (a). Thread Scheduling 1. User-Level Threads: Thread data structure maintained in user-space. 2. Kernel-Level Threads: Thread data structure maintained in kernel. 3. Hybrid Threads: Mixture of User Kernel. 4. Process data structure: Address space, open files, list of threads. 5. Thread data structure: registers, stack, state. 6. Context Switch: Assembly needed to save/load regs. MMU updated. 7. Critical region: Code where data is shared amongst processes. 8. Mutual Exclusion: Only one process has access to a CR. 9. Busy waiting: Keep checking (loop) some condition. 10. Deadlock: Process(es) are waiting (sleeping) for an event that can never occur. No work is done. 11. Starvation: Process(es) wait for an event that can happen, but doesn’t. 12. Semaphore: A counter and queue, implements P (down) V (up). 13. Mutex: IS A TYPE OF SEMAPHORE! Used for mutual exclusion. 14. Monitor: Part of a language, provides mutual exclusion. 14. Throughput, turn around time, 15. Round-Robin, Priority, Multi-queue, MLFQ, Lottery, SJF * * * * * * *