A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times

Authors:
Liliana Cucu;Eduardo Tovar
Affiliations:
IPP-Hurray Research Group, Polytechnic Institute of Porto, Porto, Portugal;IPP-Hurray Research Group, Polytechnic Institute of Porto, Porto, Portugal
Venue:
ACM SIGBED Review - Special issue: The work-in-progress (WIP) session of the RTSS 2005
Year:
2006

Citing 3
Cited 1

Real-Time Queueing Theory

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Optimal Partitioning for Quantized EDF Scheduling

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Stochastic Analysis of Periodic Real-Time Systems

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium

Efficient and robust probabilistic guarantees for real-time tasks

Journal of Systems and Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is often inadequate for a certain class of (soft) real-time systems. In this paper we provide an approach for computing the stochastic response time of tasks where tasks have inter-arrival times described by discrete probabilistic distribution functions, instead of minimum inter-arrival (MIT) values.