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.
You might also like to view...
Changes that are made to the slide ________ affect all layouts
Fill in the blank(s) with correct word
Which of the following cannot be extracted by the DatePart function?
What will be an ideal response?
The cell being copied is called the source area (or copy area). The range of cells receiving the copy is called the _____.
A. receiver cell B. final cell C. receiving range D. destination area (or paste area)
By default, the getline function will continue to read characters from the keyboard until it encounters the ‘#' character.
Answer the following statement true (T) or false (F)