A Machine Learning Based Approach for Fast Demand Characterization of Digraph Tasks

Loading...
Thumbnail Image

TR Number

Date

2025-12-15

Journal Title

Journal ISSN

Volume Title

Publisher

Virginia Tech

Abstract

Many complex real-time applications such as self-driving cars can be modeled using digraph tasks. A digraph task consists of vertices, which denote computations, and directed edges, which capture inter-task dependencies. In contrast to simpler real-time task models such as the sporadic task model, digraphs are more expressive and can model code structures such as loops. However, calculating the worst-case demand of a digraph can be time consuming, especially during online demand recharacterization. Inspired by recent advances in and successes of ML algorithms in solving problems in other application domains, we present a ML-based demand characterization framework for digraph tasks. Our framework is experimentally shown to provide accurate, safe, and fast demand (re)characterization compared to state-of-the-art techniques, which is crucial as real-time systems and cyber-physical systems increasingly become more complex and may evolve during runtime.

Description

Keywords

Real Time Systems, Digraphs, Machine-Learning, Demand Bound Function, GRU

Citation

Collections