降低LET模型下多速率因果链的端到端延迟
Reducing End-to-End Latencies of Multi-Rate Cause-Effect Chains for the LET Model
AI总结:
针对LET模型在多速率因果链端到端延迟计算中存在悲观性的问题,提出一种调度感知的LET模型,通过缩短通信区间长度、重新定位通信区间及添加任务实例依赖关系,在保持确定性的同时显著降低了最坏情况数据年龄和反应延迟。
摘要:
Logical Execution Time (LET)模型因其时间和数据流的确定性特征而日益受到工业界关注,这些特征简化了多速率因果链端到端延迟的计算,但代价是延迟较为悲观。在本文中,我们提出了一种新方法,旨在降低LET引入的延迟悲观性,同时保持其确定性。我们提出了一种调度感知的LET模型,通过缩短长度并重新定位LET的通信区间,从而获得悲观性更低的端到端延迟。通过在特定任务实例之间添加依赖关系,该方法可进一步降低LET模型延迟计算中的悲观性。若有需要(例如出于兼容遗留系统的原因),我们的方法可仅应用于任务的一个子集。我们基于真实世界的汽车基准测试和随机生成的合成任务集对我们的工作进行了评估。我们将结果与先前的工作及LET模型进行了比较。实验表明,最坏情况数据年龄和最坏情况反应延迟值均得到了显著降低。
英文摘要:
The Logical Execution Time (LET) model has been gaining industrial attention because of its timing and data-flow deterministic characteristics, which simplify the computation of end-to-end latencies of multi-rate cause-effect chains at the cost of pessimistic latencies. In this paper, we propose a novel method to reduce the pessimism in the latencies introduced by LET, while maintaining its determinism. We propose a schedule-aware LET model that shortens the lengths and repositions LET's communication intervals resulting in less pessimistic end-to-end latencies. By adding dependencies between specific task instances, the method can further reduce the pessimism in the latency calculations of the LET model. If needed, e.g., for legacy reasons, our method can be applied to a subset of tasks only. We evaluate our work based on real world automotive benchmarks and randomly generated synthetic task sets. We compare our results with previous work and the LET model. The experiments show significant reductions of worst-case data age and worst-case reaction latency values.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。