Job-aware 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.

This type of scheduling could be employed on a UMA or NUMA multiprocessor. A NUMA multiprocessor would be especially suitable for dynamic partitioning, which maximizes processor affinity. Job-aware scheduling algorithms use a global run queue, so the system would probably have to be fairly small.The interconnection scheme could be a shared bus, crossbar-switch matrix or
possibly a hypercube. These algorithms would probably be implemented on a tightly coupled system using a master/slave or symmetrical organization.