Target-sensitive systems: Analysis and implementation issues

Abstract

Several real-time applications include tasks in which the output must be produced at precise time instants, rather than "within" a deadline, and the overall system performance significantly degrades when the task is executed too late or too early with respect to the desired time.This paper illustrates one of such applications and takes it as a reference case study to propose a general approach to show how to derive the timing constraints from the application requirements, how to implement the application on top of a realtime kernel, identifying the operating system features necessary to enforce such constraints, and how to analyze the schedulability of the task set. A set of experimental results are also presented to validate the proposed approach.

Design and analysis of target-sensitive real-time systems

“…Although the papers cited in the previous text proposed new scheduling algorithms for targetsensitive task sets, no one addressed the problem of how to use such algorithms to provide a set of guidelines for the design and implementation of such systems. Buttazzo et al [16] provided a preliminary overview of the implementation issues for a specific target-sensitive application and illustrated the problems that can occur when coding the software on a real-time operating system. This paper extends the work in [16] by considering a more precise and formal analysis, presenting a more general methodology, and validating the approach with additional experiments.…”

“…Buttazzo et al [16] provided a preliminary overview of the implementation issues for a specific target-sensitive application and illustrated the problems that can occur when coding the software on a real-time operating system. This paper extends the work in [16] by considering a more precise and formal analysis, presenting a more general methodology, and validating the approach with additional experiments.…”