Departmental Papers (CIS)
Date of this Version
5-2018
Document Type
Conference Paper
Recommended Citation
Dagaen Golomb, Deepak Gangadharan, Sanjian Chen, Oleg Sokolsky, and Insup Lee, "Data Freshness Over-Engineering: Formulation and Results", IEEE ISORC 2018 . May 2018.
Abstract
In 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.
Subject Area
CPS Real-Time
Publication Source
IEEE ISORC 2018
Keywords
real-time systems, data freshness, schedulability
Date Posted: 25 June 2018
This document has been peer reviewed.
Comments
IEEE ISORC 2018, Singapore, May 29 - 31, 2018