操作系统教程05.ppt

Dispatch Latency Exercises P186-P189 5.2 5.7 End of Chapter 5 * * * * * * * * * * * * * * * * * * * * * * * Multilevel Feedback Queues Multiple-Processor Scheduling CPU scheduling more complex with MP Homogeneous processors Approaches to Multiple-Processor Scheduling Asymmetric multiprocessing Symmetric multiprocessing(SMP) Load Balancing Load sharing Symmetric Multithreading (Hyperthreading) Thread Scheduling OS schedules only kernel-level threads User-level thread must be mapped to a kernel thread to run on CPU Local Scheduling (process-contention scope, PCS) How the threads library decides which thread to put onto an available LWP M::M, M::O Global Scheduling (system-contention scope, SCS) How the kernel decides which kernel thread to run next O::O using only SCS PCS is done according to priority, set by the programmer Operating System Examples Windows XP scheduling Linux scheduling Solaris scheduling Windows XP Scheduling Priority-based, preemptive scheduling algorithm Dispatcher handles scheduling A thread selected to run will run until Preempted by a higher-priority thread Terminates Time quantum ends Calls a blocking system call The dispatcher uses a 32-level priority scheme Thread at priority 0 for memory management Variable class (1-15) Real-time class (16-31) Windows XP Scheduling If no ready thread, execute the idle thread The win32 API identifies several priority classes: REALTIME_PRIORITY_CLASS HIGH_PRIORITY_CLASS ABOVE_NORMAL_PRIORITY_CLASS NORMAL_PRIORITY_CLASS BELOW_NORMAL_PRIORITY_CLASS IDLE_PRIORITY_CLASS Windows XP Scheduling Within each of the priority classes is a relative priority, values: TIME_CRITICAL HIGHEST ABOVE_NORMAL NORMAL BELOW_NORMAL LOWEST IDLE thread priority = thread class + relative priority Base priority = normal priority for that class Windows XP Priorities Windows XP Scheduling For threads in variable-priority class when a time quantum runs out, priority lowered, but never below the base priority When released f