| 摘要 |
PROBLEM TO BE SOLVED: To provide a striping system whose video scheduling is easy. SOLUTION: When the periodical scheduling of a non-preeemptive task group corresponding to video is executed in a video server 10 having the previously decided number of processors 11 (11-1 to 11-p), respective tasks have the sets of sub-tasks which start at a previously decided period and are detached at time intervals. For scheduling the task group, the task group which can be scheduled on a single processor is divided into more than one task sets which mutually become principles. The possibility of the scheduling of the task in the group is inspected by using the greatest common divisor of the period of the task. When more than two sub-tasks belonging to the tasks which mutually become the principles are not allocated to the same time slot, the task of the group can be scheduled. |
