# Scheduling the Exchange of Context Information for Time-Triggered Adaptive Systems
## 6 Conclusions  
This study addresses a key limitation in time-triggered systems, particularly in safety-critical domains, where static resource allocation impedes adaptability to runtime changes such as failures, environmental shifts, or variable workloads. To overcome this, we in \begin{table}
\begin{tabular}{l c c c c c c c} \hline \hline
**Metric** & \
\begin{tabular}{c} **Proposed** \\ **Algorithm** \\ \end{tabular} &
\begin{tabular}{c} **No Context** \\ **Exchange** \\ \end{tabular} & **2 TU Samp.** & **4 TU Samp.** & **6 TU Samp.** & **8 TU Samp.** & **10 TU Samp.** \\ \hline Makespan Value & 7724 & 6853 & 23,986 & 15,419 & 12,563 & 11,136 & 10,279 \\ \hline \hline \end{tabular}
\end{table} 
Table 6: Makespan comparison of the proposed algorithm, the no context exchange baseline, and periodic sampling strategies at different intervals, applied to a benchmark application based on [35] consisting of 20 jobs. \begin{table}
\begin{tabular}{l c c c c c} \hline \hline
**Metric** & **Proposed Algorithm** & **2 TU Samp.** & **4 TU Samp.** & **6 TU Samp.** & **8 TU Samp.** & **10 TU Samp.** \\ \hline Communication cost & 880 & 17,132 & 8566 & 5711 & 4283 & 3427 \\ \hline \hline \end{tabular}
\end{table} 
Table 7: Communication cost comparison of the proposed algorithm and periodic sampling strategies at different intervals, applied to a benchmark application based on [35] consisting of 20 jobs. troduced a synthesis algorithm that incorporates context information exchange directly into the scheduling process. Unlike periodic sampling methods that impose regular communication overhead regardless of necessity, our approach transmits context updates selectively, only to the nodes that require them and only at relevant decision points. This targeted strategy reduces communication costs while maintaining system responsiveness and performance. Evaluation results demonstrate that our proposed method consistently outperforms traditional periodic sampling in terms of both communication efficiency and makespan. Rather than predicting when context events will occur, the algorithm efficiently handles their communication once they are triggered, ensuring timely and minimal-overhead propagation of context information. Nevertheless, a limitation of our current approach is its increasing computational demand as the number of context events grows. This introduces scalability concerns due to the potential for state-space explosion, a problem previously discussed in the literature [37]. The initial configuration effort increases with the number of context events due to the need to precompute a large number of schedule variations. Our approach preserves unchanged parts of the predecessor schedules and only reconstructs the segments affected by the context event (incremental reconstruction). Furthermore, context information is sent only to the end systems whose tasks or message schedules are impacted by the event. These optimizations help reduce both the communication and computation overhead within the multi-schedule graph (MG). While this work does not fully address large-scale scalability, future research will explore scalable representations such as context abstraction, event clustering, and AI-based schedule synthesis [38], to manage complexity while preserving the benefits of integrated context-aware scheduling. In summary, this work makes a substantial contribution to the design of adaptive time-triggered MPSoC systems by formalizing the context exchange scheduling problem, presenting an efficient synthesis algorithm, and demonstrating its practical advantages over existing approaches. Conceptualization, D.O., O.H. and R.O. ; methodology, D.O., O.H. and R.O. ; software, D.O. and O.H. ; validation, D.O., O.H. and R.O. ; formal analysis, D.O., O.H. and R.O. ; investigation, D.O. ; resources, R.O. ; data curation, O.H. ; writing--original draft preparation, D.O. ; writing--review and editing, D.O., O.H. and R.O. ; visualization, R.O. ; supervision, D.O. and R.O. ; project administration, D.O. and R.O. ; funding acquisition, R.O.