我们进行精细的仿真实验，并将仿真结果与基于授权请求的自适应循环周期时间的交织轮询方案（IPACT）进行比较，得出采用严格的优先权策略。
We conduct detailed simulation experiments and compare the results with the well-known Interleaved Polling with Adaptive Cycle Time (IPACT) algorithm that utilizes strict priority policy.
我们进行精细的仿真实验，并将仿真结果与基于授权请求的自适应循环周期时间的交织轮询方案（IPACT）进行比较，得出采用严格的优先权策略。
We conduct detailed simulation experiments and compare the results with the well-known Interleaved Polling with Adaptive Cycle Time (IPACT) algorithm that utilizes strict priority policy.
应用推荐