Probabilistic analysis of bufferless pipelines of real-time tasks
Luca Abeni, Daniele Fontanelli, Luigi Palopoli, Bernardo Villalba Frías · 2016
In this paper, we consider real--time applications consisting of multiple tasks, which are executed on computing cores managed by a resource reservatin scheduler. The tasks are organised in a linear topology (pipeline). The result produced by a task as a result of one of its activations is used as input for the task at the next stage of the pipeline. The time required for each execution of a task is a random variable. We assume a bufferless communication semantic, whereby a data item produced by a task is outright dropped if the consumer is not ready to execute.