11.3. Related Work
Task scheduling in a task concurrency management context has been investigated extensively in the last three decades. When a set of concurrent tasks, that is, tasks that can overlap in time, have to be executed on one or more processors, a predefined method called a scheduling algorithm must be applied to decide the order in which those tasks are executed. For a multiprocessor system, another procedure, assignment, is also needed to determine on which processor one task will be executed. In this chapter, the terminology task scheduling is used for both the ordering and the assignment. A good overview of task scheduling algorithms can be found in ref. 461.
Traditionally, in the real-time community, researchers tend to represent ...
Get Multiprocessor Systems-on-Chips now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
