Poster Abstract: Scheduling Dynamic IoT Task Graphs
Scheduling a given graph of tasks on a processing network has been a topic of interest and has been extensively studied, including for IoT applications. However, scheduling a series of task graphs that arrive at different time instances is still under-explored. We discuss this problem and introduce two approaches for it: Residual and Cumulative. We demonstrate using two subtle examples that both approaches face performance challenges.
Authors
- Jared Coleman (ORCID: https://orcid.org/0000-0003-1227-2962)
- Bhaskar Krishnamachari (ORCID: https://orcid.org/0000-0002-9994-9931)
- Mohammadali Khodabandehlou (ORCID: https://orcid.org/0009-0005-5791-5337)
Institutions
- University of Southern California (US)
- Loyola Marymount University (US)
Publication Details
- Published
- 2025-05-04
- DOI
- https://doi.org/10.1145/3715014.3724039
- Citations
- 1
- Primary Topic
- Optimization and Search Problems
- Type
- article
- Field-Weighted Citation Impact
- 1.49
Funders
- University of Southern California
- Army Research Laboratory