任务/资源图模型任务调度与资源访问仿真分析(Ⅰ)

Simulation Analysis for Task Scheduling and Resources Access of Task/Resource Graph(Ⅰ)

任务/资源图仿真建模方法由于包含丰富的时间属性而非常有利于分析复杂离散实时系统。首先简单回顾了任务/资源图建模方法,然后重点探讨了任务实时调度算法和资源访问控制协议。优先级驱动可抢占式算法是任务实时调度的关键,详细分析了RM算法的可调度条件。任务调度时往往会发生资源冲突,从而对任务调度有着决定性的影响,针对对资源访问控制协议对任务可调度性的影响进行了分析。

The simulation modeling method by Task/Resource Graph has many advantages in analyzing complicated discrete real-time systems due to its abundant time attributes. At first, the Task/Resource Graph modeling method is briefly reviewed, and then task real-time schedule algorithms and resource access control protocols are addressed principally. Priority-driving Preemptable algorithms are the most crucial step to real-time scheduling. It is analyzed in the paper the schedulable condition of RM algorithm in detail. While scheduling tasks, resource conflictions always emerge, which will induce decisive influence on tasks schedulability, therefore it is also analyzed in the paper the resource access control protocols and their effect on task scheduling.