Time-sensitive networks (TSNs) support not only traditional best-effort communications but also deterministic communications, which send each packet at a deterministic time so that the data transmissions of networked control systems can be precisely scheduled to guarantee hard real-time constraints. No-wait scheduling is suitable for such TSNs and generates the schedules of deterministic communications with the minimal network resources so that all of the remaining resources can be used to improve the throughput of best-effort communications. However, due to inappropriate message fragmentation, the realtime performance of no-wait scheduling algorithms is reduced. Therefore, in this paper, joint algorithms of message fragmentation and no-wait scheduling are proposed. First, a specification for the joint problem based on optimization modulo theories is proposed so that off-the-shelf solvers can be used to find optimal solutions. Second, to improve the scalability of our algorithm, the worst-case delay of messages is analyzed, and then, based on the analysis, a heuristic algorithm is proposed to construct low-delay schedules. Finally, we conduct extensive test cases to evaluate our proposed algorithms. The evaluation results indicate that, compared to existing algorithms, the proposed joint algorithm improves schedulability by up to 50%.

中文翻译：

---

时间敏感网络消息分片与无等待调度联合算法


时间敏感网络（TSN）不仅支持传统的尽力而为通信，还支持确定性通信，即在确定的时间发送每个数据包，以便可以精确调度网络控制系统的数据传输，以保证硬实时约束。无等待调度适用于此类 TSN，它可以使用最少的网络资源生成确定性通信的调度，以便可以使用所有剩余资源来提高尽力而为通信的吞吐量。然而，由于不适当的消息分片，导致无等待调度算法的实时性降低。因此，本文提出了消息分片和无等待调度的联合算法。首先，提出了基于优化模理论的联合问题规范，以便可以使用现成的求解器来寻找最优解。其次，为了提高算法的可扩展性，分析了消息的最坏情况延迟，然后基于分析，提出了一种启发式算法来构造低延迟调度。最后，我们进行了大量的测试用例来评估我们提出的算法。评估结果表明，与现有算法相比，所提出的联合算法的可调度性提高了高达50%。