聊城大学计算机学院计算机操作系统（1）英文课件 Chapter10.ppt

Multiprocessor and Real-Time Scheduling Chapter 10 Classifications of Multiprocessor Systems Loosely coupled or distributed multiprocessor, or cluster Each processor has its own memory and I/O channels Functionally specialized processors Such as I/O processor Controlled by a master processor Tightly coupled multiprocessing Processors share main memory Controlled by operating system Independent Parallelism Separate application or job No synchronization among processes Example is time-sharing system Coarse and Very Coarse-Grained Parallelism Synchronization among processes at a very gross level Good for concurrent processes running on a multiprogrammed uniprocessor Can by supported on a multiprocessor with little change Medium-Grained Parallelism Single application is a collection of threads Threads usually interact frequently Fine-Grained Parallelism Highly parallel applications Specialized and fragmented area Scheduling Assignment of processes to processors Use of multiprogramming on individual processors Actual dispatching of a process Assignment of Processes to Processors Treat processors as a pooled resource and assign process to processors on demand Permanently assign process to a processor Known as group or gang scheduling Dedicate short-term queue for each processor Less overhead Processor could be idle while another processor has a backlog Assignment of Processes to Processors Global queue Schedule to any available processor Master/slave architecture Key kernel functions always run on a particular processor Master is responsible for scheduling Slave sends service request to the master Disadvantages Failure of master brings down whole system Master can become a performance bottleneck Assignment of Processes to Processors Peer architecture Operating system can execute on any processor Each processor does self-scheduling Complicates the operating system Make sure two processors do not choose the same process Process Scheduling Single queue for all processes M