This is part 2 of a two part article that discusses in technical detail how tasks (threads) work with respect to task switching, instance data, inter-task communication, scheduling, and priority. For a general overview of threads, see a previous article. This article discusses task scheduling and priority.
The scheduling mechanism described in this article is referred to as dynamic scheduling because it allows for an unlimited number of waiting tasks; for the creation of new tasks during execution; and for task priorities to change during execution. Contrast this to a static scheduling system in which tasks are entered into a table in priority order and bound at compile-time. The result is that new tasks cannot be created during execution time, nor can task priorities be changed with static scheduling.
View Entire Paper | Previous Page | White Papers Search
If you found this page useful, bookmark and share it on: