Dynamic Scheduling Algorithm of Real-time Tasks with End-to-end Time Constraints
Uniprocessor schedulability theory made great strides,in part,due to the simplicity of composing the delay of a task from the execution time of higher-priority tasks that preempt it. In this paper,a scheduling algorithm of real-time tasks with end-to-end time constraints is proposed. When a real-time task arrives at the system,the algorithm reserves computing time for each of its subtasks on the processor assigned,so that the multiprocessor schedulability has been transformed to uniprocessor schedulability. The wealth of schedulability analysis techniques derived for uniprocessors can then be applied to decide the schedulability of real-time task with end-to-end time constraints. The experimental results demonstrate that the CPU utilization ratio and tasks accept ratio increase greatly.