论文部分内容阅读
提出了一种结合信道状况考虑的(m,k)-firm弱硬实时调度算法.该算法将消息划分为强制(mandatory)和可选(optional)2种类型,并优先调度强制消息.消息的类型由线下静态分配和线上动态调整共同决定.其中,静态分配使用(m,k)-pattern分配消息类型,动态调整是在不违反(m,k)-firm约束的前提下尽力减少强制消息在差信道状况下传输.理论分析证明:①在假设所有强制消息都实时成功传输的前提下,经动态调整的消息集仍然满足(m,k)-firm;②在使用平均分布(m,k)-pattern时,动态调整之后不改变消息集中强制消息的N次重传可调度性.仿真结果表明,该算法与仅使用静态分配消息类型的算法比较,能够改善弱硬实时的可调度性能,节省无线网络中带宽和能耗的开销.
A (m, k) -firm weak hard real-time scheduling algorithm considering channel condition is proposed, which divides the message into two types, mandatory and optional, and preferentially schedules the mandatory message. The type is determined by the combination of offline static allocation and online dynamic tuning, where static allocation uses (m, k) -pattern to assign message types and dynamic adjustment is to minimize enforceability without violating the (m, k) -firm constraint The theoretical analysis proves that: (1) the message set dynamically adjusted satisfies the (m, k) -firm on the assumption that all mandatory messages are successfully transmitted in real time; ② In the case of using the average distribution (m, k) -pattern, the Nth retransmission schedulability without changing the mandatory messages in the message set after dynamic adjustment is simulated.The simulation results show that this algorithm can improve the schedulability of weak hard real-time compared with the algorithm which only uses the statically allocated message types , Saving the cost of bandwidth and energy in the wireless network.