多处理器平台上混合关键度循环执行系统的改进算法

his paper concentrates on semi-partitioned cyclic executives for criticality multiprocessor systems where a job can be split and execute on different processors, this strategy takes the most of the advantages of the fully partitioned scheduling while it further maximizes the total utilization of processors. We propose algorithms to improve schedulability of such a system, the deadline of each frame could be reduced to an optimal/minimum value which is a necessary schedulability condition for any scheduling strategy (e.g. the total processor utilization of the tasks reaches on a platform with identical processors), while all timing requirements of the system are satisfied. We also prove that when the complete times of the 's are fixed given values, the proposed scheme of this paper to reduce the frame's deadline is optimal.