Multiple Processor scheduling

In this topic, you will learn about, Multiple Processor scheduling.

Multiple Processor scheduling: Even within homogenizes multiprocessor, there are sometimes limitations on scheduling. Let us consider a system that is an Input-Output device attached to a private Bus of one processor. Processes we seen to use that device must be scheduled to run on that process or otherwise, the device would not be available.

If several identical processors are available, then load sharing can occur. It would be possible to provide a separate queue for each processor. In this case, however, one processor could be ideal with an empty queue, while another processor was very busy. To prevent this situation, we use a common ready queue. All process goes into one queue and is scheduled onto any available processor.

In such a scheme, one of two scheduling approaches may be used. In one approach each processor is self-scheduling. That is each processor examines the common ready queue and selects a process to execute. We must ensure that two processors do not choose the same process, and that processes are not lost from the queue. The other approach avoids this problem by appointing one processer as the scheduler for the other processors thus creating of master-slave structure.

Comment below if you have queries related to the above topic, Multiple Processor scheduling.

See also  Difference between Windows and Mac OS