| 摘要 |
PROBLEM TO BE SOLVED: To efficiently schedule tasks. SOLUTION: When a message to be processed by the tasks arrives, a CPU 12 starts the tasks and makes them process the message. When a message processing is completed, the number of effective unprocessed messages (the number of messages) in the task is obtained. Next, when the number of messages of the preceding task in two adjacent tasks is larger than the number of messages of the following task, the CPU 12 judges that processing delay of the preceding task is large and processing speed of the preceding task is increased. In the opposite case, the processing delay of the preceding task is judged to be small, namely, the processing delay of the following task is judged to be large and the processing speed of the preceding task is reduced. Thus, the processing delay of all the tasks is equalized by uniformizing the processing delay between the adjacent tasks. Namely, the processing delay of the entire system is prevented depending on the task the processing by which is slow and the CPU is efficiently used.
|
