Job-blind multiprocessor scheduling.

For each of the following multiprocessor scheduling algorithms, use the classifications discussed early in this chapter to describe the type of multiprocessor system that would likely employ it. Justify your answers.

The system would have to be small, because these algorithms ignore the cost of moving processes between processors. This type of scheduling would probably be found on a UMA multiprocessor using a shared bus or crossbar-switch matrix (both are suitable for small multiprocessors). The system would be tightly coupled, because its processors would need to share resources, such as memory and processors. A master/slave or symmetrical organization could implement this type of scheduling.