| 摘要 |
PROBLEM TO BE SOLVED: To obtain an OS performing fast processing without imposing a burden on a processor by scheduling a task with hardware. SOLUTION: A bit matrix storing part 10 stores the priority of each task to be a scheduling object and information showing the order for every priority. A priority encoder 12 reads the priority of a task having the highest priority. A comparator 14 compares the priority of the read task with the priority of an active task and outputs an interrupt signal for task switching to a processor when the read priority is higher than the priority of the active task. A stack pointer address generation circuit 20 receives the task priority and the order of each different priority high in the order for every priority among applicable priority tasks and generates a stack pointer address used for task switching.
|
