Virginia Tech
A Machine Learning Based Approach for Fast Demand Characterization of Digraph Tasks
Abstract
dc:description.abstractMany 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science
- Level thesis:degree_level
- masters
- Discipline thesis:degree_discipline
- Computer Engineering
- Department dc:contributor.department
- Electrical and Computer Engineering
- Grantor dc:publisher
- Virginia Tech
- Year dc:date.issued
- 2025
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Mukherjee, Rajarshi
- Chair dc:contributor.committeechair
-
- Chantem, Thidapat
- Committee members dc:contributor.committeemember
-
- Stavrou, Angelos
- Yu, Guoqiang
Subjects
dc:subject × 5Rights
dc:rights- Statement dc:rights
-
- CC0 1.0 Universal
- Licence dc:rights.uri
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10919/143629