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.
You might also like to view...
Devise a scheme for integrating two replicas of a file system directory that underwent separate updates during disconnected operation. Use either Bayou’s operational transformation approach, or supply a solution for Coda.
What will be an ideal response?
____ service is a means of distributing broadband Internet access over the same infrastructure that offers cable television service.
A. DSL B. Dial-up Internet C. Ethernet D. Cable Internet
________ is an electronics standard that allows different kinds of electronic instruments to communicate with each other and with computers.
A. MIDI B. SOUNDID C. MUSICID D. SMID
Which characteristic is not associated with software as intellectual property?
A. uniqueness of the product B. possibility of exact replication C. automated monitoring to detect intruders D. ease of dissemination