Consider a multiprocessor CPU scheduling policy. There are 2 options: 1) a singlecommon ready queue of jobs; when a CPU becomes free, the job atthe head of the queuegoes to this free CPU. 2) a ready queue for each CPU; the arriving job joins the shortestqueue. In general, do you expect the common queue or the shortest queue policy to performbetter. Justify.
A ready queue is more adequate since in this method the load balancing occurs in a proper way. The goal of multiple processing is the correct distribution of load.
But in the cases when a processor is doing quicker or taking a smaller queue, it will self assign processes allotted for execution, configuring it with a constant busy state.
