Golomb, DagaenGangadharan, DeepakChen, SanjianSokolsky, OlegLee, Insup2023-05-222023-05-222018-05-012018-06-21https://repository.upenn.edu/handle/20.500.14332/6917In many application scenarios, data consumed by real-time tasks are required to meet a maximum age, or freshness, guarantee. In this paper, we consider the end-to-end freshness constraint of data that is passed along a chain of tasks in a uniprocessor setting. We do so with few assumptions regarding the scheduling algorithm used. We present a method for selecting the periods of tasks in chains of length two and three such that the end-to-end freshness requirement is satisfied, and then extend our method to arbitrary chains. We perform evaluations of both methods using parameters from an embedded benchmark suite (E3S) and several schedulers to support our result.CPS Real-Timereal-time systemsdata freshnessschedulabilityComputer EngineeringComputer SciencesPresentation