10.5. Multiprocessor Systems
In this section, we will extend our model for uniprocessor scheduling to handle multiprocessor scheduling . As for uniprocessor scheduling, the primary objective is to ensure that all deadlines are met. However, validating that the hard timing constraints are met is extremely difficult in the case of multiprocessor systems.
In the following discussion, we assume that each processor has its own scheduler, which uses a uniprocessor scheduling algorithm, and that the schedulers on
different processors may use different scheduling algorithms. Based on this assumption, we identify the following two important issues in multiprocessor scheduling:
Task assignment. Most real-time systems are static in the sense that tasks ...