论文标题
使PAN最大程度地限制了Ttethernet网络上的时间触发的流量
Makespan minimization of Time-Triggered traffic on a TTEthernet network
论文作者
论文摘要
越来越多的现代应用程序和系统的可靠性在很大程度上取决于互连技术。通常需要交换多媒体数据以及与安全相关信息的复杂系统,例如在汽车或航空工业中,例如,对通信的高带宽和确定性行为都提出了需求。 ttethernet是一项协议,该协议已开发为面对这些要求,同时提供以太网的宽敞带宽高达1 \,gbit/s,并通过遵循预定时间表的时间触发消息传输来增强其确定性。因此,合成满足所有实时要求的良好时间表对于整个系统的性能至关重要。 在本文中,我们研究了为时间触发的流量创建通信时间表的概念,同时最大程度地减少其制造商。目的是最大化每个集成周期中剩余流量类别的不间断差距。根据资源约束的项目调度问题制定和负载平衡启发式的提供的调度算法,即使在工业大小的实例中,也可以在5分钟内获得几乎最佳的(在非密度下限的15 \%以内)。提供方法的通用性允许根据特定的工业需求轻松修改或扩展问题声明。最后,根据对事件触发的流量的最坏情况延迟分析,通过孔隙率调度的概念来证明了MakePAN最小化的概念是合理的。
The reliability of the increasing number of modern applications and systems strongly depends on interconnecting technology. Complex systems which usually need to exchange, among other things, multimedia data together with safety-related information, as in the automotive or avionic industry, for example, make demands on both the high bandwidth and the deterministic behavior of the communication. TTEthernet is a protocol that has been developed to face these requirements while providing the generous bandwidth of Ethernet up to 1\,Gbit/s and enhancing its determinism by the Time-Triggered message transmission which follows the predetermined schedule. Therefore, synthesizing a good schedule which meets all the real-time requirements is essential for the performance of the whole system. In this paper, we study the concept of creating the communication schedules for the Time-Triggered traffic while minimizing its makespan. The aim is to maximize the uninterrupted gap for remaining traffic classes in each integration cycle. The provided scheduling algorithm, based on the Resource-Constrained Project Scheduling Problem formulation and the load balancing heuristic, obtains near-optimal (within 15\% of non-tight lower bound) solutions in 5 minutes even for industrial sized instances. The universality of the provided method allows easily modify or extend the problem statement according to particular industrial demands. Finally, the studied concept of makespan minimization is justified through the concept of scheduling with porosity according to the worst-case delay analysis of Event-Triggered traffic.