用图神经网络自动生成可调度的实时任务依赖,大幅提速且更可靠。
Schedulable Job-Level Dependencies for Cause-Effect Chains via Graph Neural Networks

- 基于两层图神经网络学习因果链结构与任务依赖的映射关系
- 生成结果经多重验证器检查,确保满足调度约束,错误率显著降低
- 适合汽车电子等高实时性系统的设计优化,尤其适合复杂依赖场景
现代汽车软件架构包含大量混合关键性功能,在共享多核平台上运行,需满足严格的实时性和端到端时延要求。传感器到执行器的数据传播通常通过因果链表示,并带有最坏情况下的数据年龄预算。作业级依赖(JLD)被提出作为与调度器无关的机制,独立于调度策略限制数据年龄。然而,现有JLD合成方法未验证生成的依赖在具体调度策略下是否可执行或系统级是否可调度。本文提出首个基于机器学习的JLD合成方法,采用双层图神经网络结合温度控制采样,学习因果链配置与其对应JLD解之间的结构模式。由于学习输出未必正确,我们设计了新的生成-验证框架:集成安全的动态规划数据年龄检查器、链级最早截止时间(EDF)可行性检查器和系统级需求边界测试,用于接受或拒绝候选解。实验表明,该机器学习生成器显著优于原始贪心启发式方法,合成时间降低数量级,证明学习到的结构先验能有效替代此类实时调度问题中的指数级传播树枚举。
原文摘要 · Abstract (English)
Modern automotive software architectures comprise large sets of mixed-criticality functions executing on shared multi-core platforms with strict real-time and end-to-end timing requirements. Sensor-to-actuator data propagation in such systems is typically expressed via cause-effect chains with worst-case data-age budgets. Job-level dependencies (JLDs) have been introduced to provide a schedule-agnostic mechanism for bounding the data age independently of the underlying scheduler. The state-of-the-art methods for synthesizing JLDs, however, do not check whether the produced JLDs are enforceable under a concrete scheduling policy or jointly schedulable at the system level. In this paper we propose the first machine-learning-based JLD synthesis method, built around a two-level Graph Neural Network with temperature-controlled sampling that learns the structural patterns connecting cause-effect chain configurations to their JLD solutions. Since learned outputs may not be correct by construction, we embed the GNN in a novel Generate-and-Verify architecture in which a safe DP data-age checker, together with a per-chain EDF feasibility checker and a system-level demand-bound test, accept or reject each candidate. We show that the ML-based generator substantially outperforms the original greedy heuristic while achieving orders-of-magnitude lower synthesis time, demonstrating that learned structural priors can effectively replace exponential propagation-tree enumeration on this class of real-time scheduling problems.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。