面向多周期循环的通信任务,设计一种适用于轮询调度消息操作时间表(message handling time table,MHTT)架构的消息操作(handling)方法。利用最大团(max-group)算法对周期任务进行优化分组,使大部分任务处于候选相容组;利用两组相容性检...面向多周期循环的通信任务,设计一种适用于轮询调度消息操作时间表(message handling time table,MHTT)架构的消息操作(handling)方法。利用最大团(max-group)算法对周期任务进行优化分组,使大部分任务处于候选相容组;利用两组相容性检查和偏移量查找,提出相容组内周期任务消息排布方法。分析和案例仿真结果说明,与不考虑次序优化的多周期消息操作相比,该方法完全保证相容周期任务的可调度性,使给定节点所需的MBI和时隙长度下限更短。展开更多
Let n 〉 0 and w be a non-empty set of primes. It is proved that the lattice of all τ-closed n-multiply ω-composition formations is inductive. It gives a positive answer to a question of Skiba asked in 2001 at the G...Let n 〉 0 and w be a non-empty set of primes. It is proved that the lattice of all τ-closed n-multiply ω-composition formations is inductive. It gives a positive answer to a question of Skiba asked in 2001 at the Gomel Algebraic Seminar.展开更多
文摘面向多周期循环的通信任务,设计一种适用于轮询调度消息操作时间表(message handling time table,MHTT)架构的消息操作(handling)方法。利用最大团(max-group)算法对周期任务进行优化分组,使大部分任务处于候选相容组;利用两组相容性检查和偏移量查找,提出相容组内周期任务消息排布方法。分析和案例仿真结果说明,与不考虑次序优化的多周期消息操作相比,该方法完全保证相容周期任务的可调度性,使给定节点所需的MBI和时隙长度下限更短。
文摘Let n 〉 0 and w be a non-empty set of primes. It is proved that the lattice of all τ-closed n-multiply ω-composition formations is inductive. It gives a positive answer to a question of Skiba asked in 2001 at the Gomel Algebraic Seminar.