Schedulability determination method, real-time systems and programs

摘要

PROBLEM TO BE SOLVED: To provide a real-time system capable of accurately determining at high speed whether or not real-time scheduling can be performed upon a plurality of cyclic tasks on a plurality of processors.;SOLUTION: In order to execute a plurality of tasks for each of cycle times predetermined for each of tasks in a plurality of processors, a scheduling means allocates each of jobs for each of the cycle times predetermined for the tasks to the plurality of processors. The distribution of execution times on the plurality of processors within the cycle time of a job allocated by the scheduling means is computed. Based on the distribution of the execution times of said job, it is determined whether or not the relevant job is to be completed until a predetermined allowable time. If a job that is determined not to be completed until the allowable time is obtained, it is determined that scheduling is impossible. If the distribution of the execution times, on the plurality of processors, of the jobs determined to be completed until the allowable time is settled, it is determined that scheduling is possible.;COPYRIGHT: (C)2007,JPO&INPIT